Pretty Good Privacy
This is the interaction network of users of the Pretty Good Privacy (PGP)
algorithm. The network contains only the giant connected component of the
network.
Metadata
Statistics
Size  n =  10,680

Volume  m =  24,316

Loop count  l =  0

Wedge count  s =  434,797

Claw count  z =  7,501,208

Cross count  x =  180,494,388

Triangle count  t =  54,788

Square count  q =  1,010,957

4Tour count  T_{4} =  9,875,476

Maximum degree  d_{max} =  205

Average degree  d =  4.553 56

Fill  p =  0.000 426 403

Size of LCC  N =  10,680

Diameter  δ =  24

50Percentile effective diameter  δ_{0.5} =  7.001 33

90Percentile effective diameter  δ_{0.9} =  10.069 9

Median distance  δ_{M} =  8

Mean distance  δ_{m} =  7.652 86

Gini coefficient  G =  0.591 824

Relative edge distribution entropy  H_{er} =  0.921 894

Power law exponent  γ =  2.109 16

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

Tail power law exponent with p  γ_{3} =  4.261 00

pvalue  p =  0.608 000

Degree assortativity  ρ =  +0.238 211

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.378 025

Spectral norm  α =  42.435 5

Algebraic connectivity  a =  0.011 160 4

Nonbipartivity  b_{A} =  0.716 478

Normalized nonbipartivity  b_{N} =  0.009 900 92

Algebraic nonbipartivity  χ =  0.018 345 5

Spectral bipartite frustration  b_{K} =  0.001 007 21

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]

Marián Boguñá, Romualdo PastorSatorras, Albert DíazGuilera, and Alex
Arenas.
Models of social networks based on social distance attachment.
Phys. Rev. E, 70(5):056122, 2004.
