Stanford
This is the directed network of hyperlinks between the web pages from the
website of the Stanford University.
Metadata
Statistics
Size  n =  281,903

Volume  m =  2,312,497

Loop count  l =  0

Wedge count  s =  3,944,069,093

Claw count  z =  25,253,733,860,230

Cross count  x =  161,421,116,331,688,192

Triangle count  t =  11,329,473

Square count  q =  13,316,840,570

4Tour count  T_{4} =  122,314,986,204

Maximum degree  d_{max} =  38,626

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

Maximum indegree  d^{−}_{max} =  38,606

Average degree  d =  16.406 3

Fill  p =  2.909 94 × 10^{−5}

Size of LCC  N =  255,265

Size of LSCC  N_{s} =  150,532

Relative size of LSCC  N^{r}_{s} =  0.533 985

Diameter  δ =  164

50Percentile effective diameter  δ_{0.5} =  5.507 63

90Percentile effective diameter  δ_{0.9} =  8.788 03

Mean distance  δ_{m} =  6.362 93

Gini coefficient  G =  0.609 279

Balanced inequality ratio  P =  0.270 840

Outdegree balanced inequality ratio  P_{+} =  0.296 020

Indegree balanced inequality ratio  P_{−} =  0.199 346

Relative edge distribution entropy  H_{er} =  0.894 113

Power law exponent  γ =  1.537 77

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

Degree assortativity  ρ =  −0.112 445

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  +0.329 225

Clustering coefficient  c =  0.008 617 60

Spectral norm  α =  449.572

Operator 2norm  ν =  438.345

Cyclic eigenvalue  π =  48.375 6

Algebraic connectivity  a =  0.000 171 694

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.051 30

Reciprocity  y =  0.276 637

Nonbipartivity  b_{A} =  0.048 796 6

Normalized nonbipartivity  b_{N} =  0.000 583 688

Spectral bipartite frustration  b_{K} =  2.329 34 × 10^{−5}

Controllability  C =  97,500

Relative controllability  C_{r} =  0.345 864

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 ]

[2]

Jure Leskovec, Kevin Lang, Anirban Dasgupta, and Michael W. Mahoney.
Community structure in large networks: Natural cluster sizes and the
absence of large welldefined clusters.
Internet Math., 6(1):29–123, 2009.
