uk-2007-05@100000

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 100000 nodes centred at a random node. It simulates the result of a small breadth-first crawl around the node.

Basic data nodes 100 000 arcs 3 050 615 bits/link 1.58 (12.04%) bits/link (transpose) 1.312 (10.00%) average degree 30.506 maximum indegree 55 252 maximum outdegree 3 753 dangling nodes 4.97% buckets 6.58% largest component 53 856 (53.86%) average distance 6.03 (± 0.018) reachable pairs 60.42% (± 0.485) median distance 9 (50.30%) harmonic diameter 7.93 (± 0.060) Random access (recommended) Filename Size uk-2007-05@100000.graph 760K uk-2007-05@100000.properties 4.0K uk-2007-05@100000-t.graph 536K uk-2007-05@100000-t.properties 4.0K uk-2007-05@100000.md5sums 4.0K uk-2007-05@100000.stats 4.0K uk-2007-05@100000.indegree 112K uk-2007-05@100000.outdegree 8.0K uk-2007-05@100000.scc 392K uk-2007-05@100000.sccsizes 24K Sequential access (high compression) Filename Size uk-2007-05@100000-hc.graph 592K uk-2007-05@100000-hc.properties 4.0K uk-2007-05@100000-hc-t.graph 492K uk-2007-05@100000-hc-t.properties 4.0K Natural order (random access) Filename Size uk-2007-05@100000-nat.graph 900K uk-2007-05@100000-nat.properties 4.0K JGraphT serialized succinct representation Filename Size uk-2007-05@100000.suxdir 11M

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