Eastern USA
This is the directed road network from the 9th DIMACS Implementation Challenge,
for the area "Eastern USA".
Metadata
Statistics
Size  n =  3,598,623

Volume  m =  8,708,058

Loop count  l =  0

Wedge count  s =  7,777,436

Claw count  z =  55,661,936

Cross count  x =  51,173,564

Triangle count  t =  73,666

Square count  q =  254,067

4Tour count  T_{4} =  41,850,338

Maximum degree  d_{max} =  18

Maximum outdegree  d^{+}_{max} =  9

Maximum indegree  d^{−}_{max} =  9

Average degree  d =  4.839 66

Fill  p =  6.724 33 × 10^{−7}

Size of LCC  N =  3,598,623

Size of LSCC  N_{s} =  3,598,623

Relative size of LSCC  N^{r}_{s} =  1.000 00

Diameter  δ =  4,461

50Percentile effective diameter  δ_{0.5} =  1,217.23

90Percentile effective diameter  δ_{0.9} =  2,307.83

Mean distance  δ_{m} =  1,322.61

Gini coefficient  G =  0.211 811

Balanced inequality ratio  P =  0.422 759

Outdegree balanced inequality ratio  P_{+} =  0.422 759

Indegree balanced inequality ratio  P_{−} =  0.422 759

Relative edge distribution entropy  H_{er} =  0.994 590

Power law exponent  γ =  2.266 61

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

Degree assortativity  ρ =  +0.069 461 4

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.028 415 3

Spectral norm  α =  8.670 33

Operator 2norm  ν =  4.335 17

Cyclic eigenvalue  π =  4.335 17

Algebraic connectivity  a =  1.642 72 × 10^{−7}

Reciprocity  y =  1.000 00

Nonbipartivity  b_{A} =  0.091 415 7

Normalized nonbipartivity  b_{N} =  8.569 60 × 10^{−5}

Spectral bipartite frustration  b_{K} =  1.762 70 × 10^{−5}

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 ]
