hu-tel-2006

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

This graph is built from the detailed call record of Hungarian Telekom for a eighth-month time frame in 2006. Measurements were performed by the Hungarian Academy of Sciences running our software. The graph was used by Miklós Kurucz, András Benczúr, Károly Csalogány, and László Lukács in the paper “Spectral clustering in telephone call graphs”, WebKDD/SNA-KDD '07: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, pages 82−91, 2007, ACM Press.

Basic data
nodes2 317 492
arcs46 126 952
bits/link15.361 (84.07%)
bits/link (transpose)14.723 (80.58%)
average degree19.904
maximum indegree46 692
maximum outdegree2 640
dangling nodes11.65%
buckets0.01%
largest component1 931 495 (83.34%)
spid0.10 (± 0.001)
average distance5.19 (± 0.004)
reachable pairs74.43% (± 0.625)
median distance5 (50.72%)
harmonic diameter6.83 (± 0.054)
Random access (recommended)
FilenameSize
hu-tel-2006.properties4.0K
hu-tel-2006-t.properties4.0K
hu-tel-2006.stats4.0K
hu-tel-2006.indegree92K
hu-tel-2006.outdegree8.0K
Sequential access (high compression)
FilenameSize
hu-tel-2006-hc.properties4.0K
hu-tel-2006-hc-t.properties4.0K
Natural order (random access)
FilenameSize
hu-tel-2006-nat.properties4.0K
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