Autonomous systems (DIMACS10)
This is a snapshot of the structure of the Internet at the level of autonomous
systems, reconstructed from BGP tables posted by the University of Oregon Route
Views Project.
Metadata
Statistics
Size  n =  22,963

Volume  m =  48,436

Loop count  l =  0

Wedge count  s =  12,615,661

Claw count  z =  6,012,695,865

Cross count  x =  2,783,793,490,302

Triangle count  t =  46,873

Square count  q =  3,089,604

4Tour count  T_{4} =  75,276,348

Maximum degree  d_{max} =  2,390

Average degree  d =  4.218 61

Fill  p =  0.000 183 721

Size of LCC  N =  22,963

Diameter  δ =  11

50Percentile effective diameter  δ_{0.5} =  3.215 61

90Percentile effective diameter  δ_{0.9} =  4.468 21

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  3.738 56

Gini coefficient  G =  0.631 878

Relative edge distribution entropy  H_{er} =  0.836 172

Power law exponent  γ =  2.435 17

Tail power law exponent  γ_{t} =  2.091 00

Tail power law exponent with p  γ_{3} =  2.091 00

pvalue  p =  0.660 000

Degree assortativity  ρ =  −0.198 385

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.011 146 4

Spectral norm  α =  71.613 0

Algebraic connectivity  a =  0.050 699 4

Nonbipartivity  b_{A} =  0.236 971

Normalized nonbipartivity  b_{N} =  0.036 705 4

Algebraic nonbipartivity  χ =  0.071 860 9

Spectral bipartite frustration  b_{K} =  0.004 258 56

Plots
Matrix decompositions plots
Downloads
References
[1]

Jérôme Kunegis.
KONECT – The Koblenz Network Collection.
In Proc. Int. Conf. on World Wide Web Companion, pages
1343–1350, 2013.
[ http ]
