Google.com internal

This is the hyperlink network from pages within Google's own sites, i.e., on google.com.

Metadata

CodeGC
Internal namecfinder-google
NameGoogle.com internal
Data sourcehttp://cfinder.org/wiki/?n=Main.Data
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningPage
Edge meaningHyperlink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =15,763
Volume m =171,206
Loop count l =871
Wedge count s =133,820,601
Claw count z =354,444,098,866
Cross count x =878,284,318,865,620
Triangle count t =591,156
Square count q =196,281,177
4-Tour count T4 =2,105,828,990
Maximum degree dmax =11,408
Maximum outdegree d+max =852
Maximum indegree dmax =11,397
Average degree d =21.722 5
Fill p =0.000 689 035
Size of LCC N =15,763
Size of LSCC Ns =12,354
Relative size of LSCC Nrs =0.783 734
Diameter δ =7
50-Percentile effective diameter δ0.5 =1.963 41
90-Percentile effective diameter δ0.9 =2.933 81
Median distance δM =2
Mean distance δm =2.555 10
Gini coefficient G =0.636 260
Relative edge distribution entropy Her =0.879 364
Power law exponent γ =1.485 09
Tail power law exponent γt =2.681 00
Degree assortativity ρ =−0.121 510
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.527 265
Clustering coefficient c =0.013 252 6
Spectral norm α =178.018
Operator 2-norm ν =162.422
Cyclic eigenvalue π =61.075 3
Algebraic connectivity a =0.009 382 19
Reciprocity y =0.259 167
Non-bipartivity bA =0.165 743
Normalized non-bipartivity bN =0.004 475 19
Spectral bipartite frustration bK =0.000 117 648

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

Degree assortativity

Zipf plot

Hop distribution

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution

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 ]
[2] Gergely Palla, Illés J. Farkas, Péter Pollner, Imre Derényi, and Tamás Vicsek. Directed network modules. New J. Phys., 9(6):186, 2007.