Haggle
This undirected network represents contacts between people measured by carried
wireless devices. A node represents a person; an edge between two persons shows
that there was a contact between them.
Metadata
Statistics
Size  n =  274

Volume  m =  28,244

Unique edge count  m̿ =  2,899

Loop count  l =  0

Wedge count  s =  118,281

Claw count  z =  9,250,623

Cross count  x =  255,553,498

Triangle count  t =  22,332

Square count  q =  848,067

4Tour count  T_{4} =  7,261,908

Maximum degree  d_{max} =  2,092

Average degree  d =  206.161

Fill  p =  0.077 511 3

Average edge multiplicity  m̃ =  9.742 67

Size of LCC  N =  274

Diameter  δ =  4

50Percentile effective diameter  δ_{0.5} =  1.949 57

90Percentile effective diameter  δ_{0.9} =  2.792 77

Median distance  δ_{M} =  2

Mean distance  δ_{m} =  2.415 27

Gini coefficient  G =  0.841 739

Balanced inequality ratio  P =  0.110 360

Relative edge distribution entropy  H_{er} =  0.794 985

Power law exponent  γ =  1.672 86

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

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

pvalue  p =  0.000 00

Degree assortativity  ρ =  −0.474 322

Degree assortativity pvalue  p_{ρ} =  2.635 98 × 10^{−237}

Clustering coefficient  c =  0.566 414

Spectral norm  α =  1,231.03

Algebraic connectivity  a =  0.992 336

Spectral separation  λ_{1}[A] / λ_{2}[A] =  5.811 49

Nonbipartivity  b_{A} =  0.827 927

Normalized nonbipartivity  b_{N} =  0.466 542

Algebraic nonbipartivity  χ =  0.827 831

Spectral bipartite frustration  b_{K} =  0.013 349 0

Controllability  C =  192

Relative controllability  C_{r} =  0.700 730

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]

Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and
James Scott.
Impact of human mobility on opportunistic forwarding algorithms.
IEEE Trans. on Mobile Comput., 6(6):606–620, 2007.
