Gnutella (30)

This is a network of Gnutella hosts from 2002. The nodes represent Gnutella hosts, and the directed edges represent connections between them. The dataset is from August 30, 2002.

Metadata

CodeGN
Internal namep2p-Gnutella30
NameGnutella (30)
Data sourcehttp://snap.stanford.edu/data/p2p-Gnutella30.html
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Computer network
Dataset timestamp 2002-08-30
Node meaningHost
Edge meaningConnection
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalDoes not contain reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops

Statistics

Size n =36,682
Volume m =88,328
Loop count l =0
Wedge count s =923,756
Claw count z =4,477,812
Cross count x =19,735,194
Triangle count t =1,590
Square count q =46,363
4-Tour count T4 =4,242,584
Maximum degree dmax =55
Maximum outdegree d+max =54
Maximum indegree dmax =54
Average degree d =4.815 88
Fill p =6.564 54 × 10−5
Size of LCC N =36,646
Size of LSCC Ns =8,490
Relative size of LSCC Nrs =0.231 449
Diameter δ =11
50-Percentile effective diameter δ0.5 =5.456 36
90-Percentile effective diameter δ0.9 =6.691 63
Median distance δM =6
Mean distance δm =5.898 38
Gini coefficient G =0.558 875
Relative edge distribution entropy Her =0.947 124
Power law exponent γ =2.035 68
Tail power law exponent γt =4.901 00
Degree assortativity ρ =−0.103 375
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.303 441
Clustering coefficient c =0.005 163 70
Directed clustering coefficient c± =0.004 631 62
Spectral norm α =12.928 7
Operator 2-norm ν =9.985 77
Cyclic eigenvalue π =3.874 98
Algebraic connectivity a =0.114 640
Reciprocity y =0.000 00
Non-bipartivity bA =0.166 035
Spectral bipartite frustration bK =0.005 945 19

Plots

Fruchterman–Reingold graph drawing

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

Delaunay graph drawing

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] Matei Ripeanu, Ian Foster, and Adriana Iamnitchi. Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Comput. J., 6, 2002.