Berkeley/Stanford
This is the hyperlink network of the websites of the Universities in Berkley
and Stanford. Nodes represent web pages, and directed edges represent
hyperlinks.
Metadata
Statistics
Size  n =  685,230

Volume  m =  7,600,595

Loop count  l =  0

Wedge count  s =  27,982,987,280

Claw count  z =  383,198,935,132,861

Cross count  x =  4,925,431,856,926,247,936

Triangle count  t =  64,690,980

Square count  q =  127,118,333,411

4Tour count  T_{4} =  1,128,891,915,348

Maximum degree  d_{max} =  84,290

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

Maximum indegree  d^{−}_{max} =  84,208

Average degree  d =  22.184 1

Fill  p =  1.618 73 × 10^{−5}

Size of LCC  N =  654,782

Size of LSCC  N_{s} =  334,857

Relative size of LSCC  N^{r}_{s} =  0.488 678

Diameter  δ =  208

50Percentile effective diameter  δ_{0.5} =  6.501 42

90Percentile effective diameter  δ_{0.9} =  9.788 90

Mean distance  δ_{m} =  7.211 72

Gini coefficient  G =  0.659 006

Balanced inequality ratio  P =  0.250 475

Outdegree balanced inequality ratio  P_{+} =  0.282 235

Indegree balanced inequality ratio  P_{−} =  0.169 903

Relative edge distribution entropy  H_{er} =  0.886 433

Power law exponent  γ =  1.486 07

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

Degree assortativity  ρ =  −0.112 728

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  +0.313 250

Clustering coefficient  c =  0.006 935 39

Spectral norm  α =  697.551

Operator 2norm  ν =  674.675

Cyclic eigenvalue  π =  162.347

Algebraic connectivity  a =  2.784 94 × 10^{−5}

Reciprocity  y =  0.250 276

Nonbipartivity  b_{A} =  0.058 559 0

Normalized nonbipartivity  b_{N} =  0.000 201 474

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

[2]

Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney.
Statistical properties of community structure in large social and
information networks.
In Proc. Int. World Wide Web Conf., pages 695–704, 2008.
