RDF Graph Measures for the Analysis of RDF Graphs

Home / Linguistics / universal-dependencies-treebank-romanian

universal-dependencies-treebank-romanian

Data and Resources

Measures

Notation Description Value
m graph volume (no. of edges) 269,631
n graph size (no. of vertices) 40,530
dmax max degree 27,300
d+max max in-degree 27,289
d-max
Effective measure!Score: 0.04

Datasets in this domain can be very well described by means of this particular measure.

max out-degree 10
z mean total degree 13.3
h+
h-index, respecting in-degree
Known from citation networks, this measure is an indicator for the importance of a vertex in the graph, similar to a centrality measure. A value of h means that for the number of h vertices the degree of these vertices is greater or equal to h. A high value of h could be an indicator for a "dense" graph and that its vertices are more "prestigious". The value is computed by respecting the in-degree distribution of the graph, denoted as h+.
174
h h-index, respecting total degree 174
pmu fill, respecting unique edges only 0
p fill, respecting overall edges 0
mp
parallel edges
Based on the measure mu, this is the number of parallel edges, i.e., the total number of edges that share the same pair of source and target vertices. It is computed by subtracting mu from the total number of edges m, i.e. mp = m – mu.
22,190
mu
unique edges
In RDF, a pair of subject and object resources may be described with more than one predicate. Hence, in the graphs, there may exist a fraction of all edges that share the same pair of (subject and object) vertices. The value for mu represents the total number of edges without counting these multiple edges between a pair of vertices.
247,441
y reciprocity 0.039
δ
Effective measure!Score: 0.237

Datasets in this domain can be very well described by means of this particular measure.

diameter (approximated)
The diameter is the longest shortest path between a pair of two vertices in the graph (as there can be more than one path for the pair of vertices). As this requires all possible paths to be computed, this is a very computational intensive measure. We used the pseudo_diameter-algorithm provided by graph-tool, which is an approximation method for the diameter of the graph. As the graph can have many components, this algorithm very often returns the value of 1. If this should be the case for this graph, we compute the diameter for the largest connecting component.
1,190
PR max pagerank value 0.011
Cd+ max in-degree centrality 0.673
Cd- max out-degree centrality 0
Cd max degree centrality 0.673
α powerlaw exponent, degree distribution 8.246
dminα dmin for α 11
α+ powerlaw exponent, in-degree distribution 2.869
dminα+ dmin for α+ 3
σ+ standard deviation, in-degree distribution 157.178
σ- standard deviation, out-degree distribution 4.54
cv+ coefficient variation, in-degree distribution 2,362.64
cv- coefficient variation, out-degree distribution 68.236
σ2+ variance, in-degree distribution 24,704.763
σ2- variance, out-degree distribution 20.607
C+d graph centralization 0.673
z-
Effective measure!Score: 0.174

Datasets in this domain can be very well described by means of this particular measure.

mean out-degree 9.467
deg(G)
Effective measure!Score: 0.168

Datasets in this domain can be very well described by means of this particular measure.

max partial out-degree 1
deg(G) mean partial out-degree 1
degL(G)
Effective measure!Score: 0.098

Datasets in this domain can be very well described by means of this particular measure.

max labelled out-degree 10
degL(G) mean labelled out-degree 9.467
degD(G)
Effective measure!Score: 0.037

Datasets in this domain can be very well described by means of this particular measure.

max direct out-degree 10
degD(G) mean direct out-degree 8.688
z+ mean in-degree 6.772
deg++(G) max partial in-degree 27,289
deg++(G) mean partial in-degree 4.955
degL+(G) max labelled in-degree 4
degL+(G) mean labelled in-degree 1.367
degD+(G) max direct in-degree 27,289
degD+(G)
Effective measure!Score: 0.045

Datasets in this domain can be very well described by means of this particular measure.

mean direct in-degree 6.214
degP(G) max predicate degree 28,480
degP(G) mean predicate degree 24,511.909
degP+(G) max predicate in-degree 28,480
degP+(G) mean predicate in-degree 24,511.909
degP(G) max predicate out-degree 26,098
degP(G) mean predicate out-degree 4,947.091
so(G) subject-object ratio 0.685
rL(G) ratio of repreated predicate lists 1
degPL(G) max predicate list degree 22,858
degPL(G) mean predicate list degree 3,560
CG distinct classes 2
SGC all different typed subjects 28,480
rT(G) ratio of typed subjects 1

Plots

Degree distribution shown here
In-degree distribution shown here
Last update of this page: 25 March 2020 13:38:38 CET