dblp-2010

If you publish results based on this graph, please quote the references suggested in the dataset page.

DBLP is a bibliography service from which an undirected scientific collaboration network can be extracted: each vertex represents a scientist and two vertices are connected if they have worked together on an article. This symmetric graph has been obtained in June 2010 from the standard DBLP download.

Basic data
nodes326 186
arcs1 615 400
bits/link6.776 (38.83%)
bits/link (transpose)6.776 (38.83%)
average degree4.952
maximum indegree238
maximum outdegree238
dangling nodes7.83%
buckets92.17%
largest component226 413 (69.41%)
average distance7.35 (± 0.012)
reachable pairs47.74% (± 0.483)
median distance
harmonic diameter14.64 (± 0.135)
Random access (recommended)
FilenameSize
dblp-2010.graph1.4M
dblp-2010.properties4.0K
dblp-2010-t.graph1.4M
dblp-2010-t.properties4.0K
dblp-2010.map3.4M
dblp-2010.smap3.4M
dblp-2010.md5sums4.0K
dblp-2010.lmap7.0M
dblp-2010.fcl6.2M
dblp-2010.ids.gz2.4M
dblp-2010.stats4.0K
dblp-2010.indegree4.0K
dblp-2010.outdegree4.0K
dblp-2010.scc1.3M
dblp-2010.sccsizes192K
Sequential access (high compression)
FilenameSize
dblp-2010-hc.graph1.4M
dblp-2010-hc.properties4.0K
dblp-2010-hc-t.graph1.4M
dblp-2010-hc-t.properties4.0K
Natural order (random access)
FilenameSize
dblp-2010-nat.graph2.3M
dblp-2010-nat.properties4.0K
dblp-2010-nat.fcl5.0M
dblp-2010-nat.ids.gz2.4M
Indegree-frequency plotIndegree-frequency plot (with Fibonacci binning)
Outdegree-frequency plotOutdegree-frequency plot (with Fibonacci binning)
Indegree-rank plot (cumulative)Indegree-rank plot (cumulative)
Outdegree-rank plot (cumulative)Outdegree-rank plot (cumulative)
Distance probability mass functiondistance probability mass function
Connected-components size distributionConnected-components size distribution
Large connected componentsLarge connected components
Distribution of the logarithm of successor gapsDistribution of the logarithm of the successor gaps
Distribution of successor gapsDistribution of successor gaps