Gnutella (25)

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 25, 2002.

Metadata

CodeGN
Internal namep2p-Gnutella25
NameGnutella (25)
Data sourcehttp://snap.stanford.edu/data/p2p-Gnutella25.html
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Computer network
Dataset timestamp 2002-08-25
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 =22,687
Volume m =54,705
Loop count l =0
Wedge count s =533,121
Claw count z =2,358,958
Cross count x =10,118,599
Triangle count t =806
Square count q =13,517
4-Tour count T4 =2,350,030
Maximum degree dmax =66
Maximum outdegree d+max =64
Maximum indegree dmax =36
Average degree d =4.822 59
Fill p =0.000 106 290
Size of LCC N =22,663
Size of LSCC Ns =5,153
Relative size of LSCC Nrs =0.227 134
Diameter δ =11
50-Percentile effective diameter δ0.5 =5.140 93
90-Percentile effective diameter δ0.9 =6.548 47
Median distance δM =6
Mean distance δm =5.615 42
Gini coefficient G =0.541 804
Relative edge distribution entropy Her =0.948 837
Power law exponent γ =1.993 94
Tail power law exponent γt =7.121 00
Degree assortativity ρ =−0.172 839
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.255 514
Clustering coefficient c =0.004 535 56
Directed clustering coefficient c± =0.004 200 65
Spectral norm α =10.920 0
Operator 2-norm ν =8.542 71
Cyclic eigenvalue π =3.402 93
Algebraic connectivity a =0.054 799 7
Reciprocity y =0.000 00
Non-bipartivity bA =0.148 457
Spectral bipartite frustration bK =0.002 835 27

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.