RDF Graph Measures for the Analysis of RDF Graphs

Home / Life sciences / bio2rdf-pharmgkb

bio2rdf-pharmgkb

Data and Resources

Measures

Notation Description Value
m graph volume (no. of edges) 462,661,689
n graph size (no. of vertices) 205,835,474
dmax max degree 50,100,000
d+max max in-degree 50,082,768
d-max max out-degree 24,784,825
z mean total degree 4.5
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+.
3,867
h h-index, respecting total degree 4,028
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.
124,489,267
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.
338,172,422
y reciprocity 0
δ
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.
0
PR max pagerank value 0
Cd+ max in-degree centrality 0.243
Cd- max out-degree centrality 0.12
Cd max degree centrality 0.243
α powerlaw exponent, degree distribution 125.26
dminα dmin for α 12
α+ powerlaw exponent, in-degree distribution 239.382
dminα+ dmin for α+ 1
σ+ standard deviation, in-degree distribution 5,274.094
σ- standard deviation, out-degree distribution 1,779.844
cv+ coefficient variation, in-degree distribution 234,641
cv-
Effective measure!Score: 0.256

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

coefficient variation, out-degree distribution 79,184.2
σ2+ variance, in-degree distribution 27,816,066.709
σ2- variance, out-degree distribution 3,167,845.677
C+d graph centralization 0.243
z-
Effective measure!Score: 0.096

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

mean out-degree 15.238
$$deg^{--}(G)$$
Effective measure!Score: 0.117

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

max partial out-degree 24,784,818
$$\overline{deg^{--}}(G)$$ mean partial out-degree 1.522
$$deg^-_L(G)$$
Effective measure!Score: 0.159

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

max labelled out-degree 35
$$\overline{deg^-_L}(G)$$ mean labelled out-degree 10.013
$$deg^-_D(G)$$
Effective measure!Score: 0.042

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

max direct out-degree 5,758
$$\overline{deg^-_D}(G)$$ mean direct out-degree 11.138
z+ mean in-degree 2.63
$$deg^{++}(G)$$ max partial in-degree 50,082,768
$$\overline{deg^{++}}(G)$$ mean partial in-degree 2.629
$$deg^+_L(G)$$
Effective measure!Score: 0.08

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

max labelled in-degree 6
$$\overline{deg^+_L}(G)$$ mean labelled in-degree 1
$$deg^+_D(G)$$ max direct in-degree 25,263,480
$$\overline{deg^+_D}(G)$$
Effective measure!Score: 0.055

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

mean direct in-degree 1.922
$$deg_P(G)$$ max predicate degree 99,980,372
$$\overline{deg_P}(G)$$ mean predicate degree 6,168,822.52
$$deg^+_P(G)$$ max predicate in-degree 30,362,936
$$\overline{deg^+_P}(G)$$ mean predicate in-degree 4,053,491.707
$$deg^-_P(G)$$ max predicate out-degree 30,362,890
$$\overline{deg^-_P}(G)$$ mean predicate out-degree 2,346,078.12
$$\propto_{s-o}(G)$$ subject-object ratio 0.002
$$r_L(G)$$ ratio of repreated predicate lists 0.999
$$deg_{PL}(G)$$ max predicate list degree 24,784,803
$$\overline{deg_{PL}}(G)$$ mean predicate list degree 1,746.301
$$C_G$$ distinct classes 56
$$S^C_G$$ all different typed subjects 30,362,936
$$r_T(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