uk-2007-05@1000000

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

This graph has been artificially genereted from uk-2007-05. It is a ball (in the graph metric sense) of 1000000 nodes centred at a random node. It simulates the result of a small breadth-first crawl around the node.

Basic data nodes 1 000 000 arcs 41 247 159 bits/link 1.249 (7.80%) bits/link (transpose) 0.972 (6.07%) average degree 41.247 maximum indegree 403 441 maximum outdegree 4 655 dangling nodes 4.58% buckets 1.14% largest component 480 913 (48.09%) average distance 9.04 (± 0.017) reachable pairs 65.38% (± 0.538) median distance 12 (53.29%) harmonic diameter 11.21 (± 0.082) Random access (recommended) Filename Size uk-2007-05@1000000.graph 8.3M uk-2007-05@1000000.properties 4.0K uk-2007-05@1000000-t.graph 5.2M uk-2007-05@1000000-t.properties 4.0K uk-2007-05@1000000.md5sums 4.0K uk-2007-05@1000000.stats 4.0K uk-2007-05@1000000.indegree 792K uk-2007-05@1000000.outdegree 12K uk-2007-05@1000000.scc 3.9M uk-2007-05@1000000.sccsizes 196K Sequential access (high compression) Filename Size uk-2007-05@1000000-hc.graph 6.2M uk-2007-05@1000000-hc.properties 4.0K uk-2007-05@1000000-hc-t.graph 4.8M uk-2007-05@1000000-hc-t.properties 4.0K Natural order (random access) Filename Size uk-2007-05@1000000-nat.graph 11M uk-2007-05@1000000-nat.properties 4.0K JGraphT serialized succinct representation Filename Size uk-2007-05@1000000.suxdir 170M

Indegree-frequency plot Outdegree-frequency plot Indegree-rank plot (cumulative) Outdegree-rank plot (cumulative) Distance probability mass function Connected-components size distribution Large connected components Distribution of the logarithm of successor gaps Distribution of successor gaps