California and Nevada
This is the directed road network from the 9th DIMACS Implementation Challenge,
for the area "California and Nevada".
Metadata
Statistics
Size  n =  1,890,815

Volume  m =  4,630,444

Loop count  l =  0

Wedge count  s =  4,192,229

Claw count  z =  30,258,364

Cross count  x =  28,228,721

Triangle count  t =  34,672

Square count  q =  134,075

4Tour count  T_{4} =  22,471,960

Maximum degree  d_{max} =  14

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

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

Average degree  d =  4.897 83

Fill  p =  1.295 16 × 10^{−6}

Size of LCC  N =  1,890,815

Size of LSCC  N_{s} =  1,890,815

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

Diameter  δ =  2,315

50Percentile effective diameter  δ_{0.5} =  766.790

90Percentile effective diameter  δ_{0.9} =  1,248.86

Mean distance  δ_{m} =  778.470

Gini coefficient  G =  0.209 777

Balanced inequality ratio  P =  0.424 340

Outdegree balanced inequality ratio  P_{+} =  0.424 340

Indegree balanced inequality ratio  P_{−} =  0.424 340

Relative edge distribution entropy  H_{er} =  0.994 497

Power law exponent  γ =  2.243 70

Degree assortativity  ρ =  +0.074 357 5

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  +1.000 00

Clustering coefficient  c =  0.024 811 6

Spectral norm  α =  8.605 43

Operator 2norm  ν =  4.302 72

Cyclic eigenvalue  π =  4.302 72

Algebraic connectivity  a =  3.677 81 × 10^{−7}

Reciprocity  y =  1.000 00

Nonbipartivity  b_{A} =  0.087 808 9

Normalized nonbipartivity  b_{N} =  0.000 181 755

Spectral bipartite frustration  b_{K} =  3.677 17 × 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 ]
