Eastern USA

This is the directed road network from the 9th DIMACS Implementation Challenge, for the area "Eastern USA".

Metadata

Code9E
Internal namedimacs9-E
NameEastern USA
Data sourcehttp://www.diag.uniroma1.it/challenge9/download.shtml
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Infrastructure network
Dataset timestamp 1991
Node meaningNode
Edge meaningRoad
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops

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
4-Tour count T4 =41,850,338
Maximum degree dmax =18
Maximum outdegree d+max =9
Maximum indegree dmax =9
Average degree d =4.839 66
Fill p =6.724 33 × 10−7
Size of LCC N =3,598,623
Size of LSCC Ns =3,598,623
Relative size of LSCC Nrs =1.000 00
Diameter δ =4,461
50-Percentile effective diameter δ0.5 =1,217.23
90-Percentile effective diameter δ0.9 =2,307.83
Median distance δM =1,218
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 Her =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 p-value pρ =0.000 00
Clustering coefficient c =0.028 415 3
Directed clustering coefficient c± =0.028 415 3
Spectral norm α =8.670 33
Operator 2-norm ν =4.335 17
Cyclic eigenvalue π =4.335 17
Algebraic connectivity a =1.642 72 × 10−7
Reciprocity y =1.000 00
Non-bipartivity bA =0.091 415 7
Normalized non-bipartivity bN =8.569 60 × 10−5
Algebraic non-bipartivity χ =0.000 170 618
Spectral bipartite frustration bK =1.762 70 × 10−5

Plots

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Hop distribution

In/outdegree scatter plot

SynGraphy

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 ]