BookCrossing (implicit)
This network contains information about books read by members of the
BookCrossing community. Nodes of the network are users and books, and an edge
denotes that a user has interacted with a book.
Metadata
Statistics
Size  n =  445,801

Left size  n_{1} =  105,278

Right size  n_{2} =  340,523

Volume  m =  1,149,739

Wedge count  s =  465,125,366

Claw count  z =  751,050,106,734

Cross count  x =  1,817,486,272,201,908

Square count  q =  93,843,300

4Tour count  T_{4} =  2,613,565,786

Maximum degree  d_{max} =  13,601

Maximum left degree  d_{1max} =  13,601

Maximum right degree  d_{2max} =  2,502

Average degree  d =  5.158 08

Average left degree  d_{1} =  10.921 0

Average right degree  d_{2} =  3.376 39

Fill  p =  3.207 12 × 10^{−5}

Size of LCC  N =  420,143

Diameter  δ =  19

50Percentile effective diameter  δ_{0.5} =  4.118 29

90Percentile effective diameter  δ_{0.9} =  5.781 38

Median distance  δ_{M} =  5

Mean distance  δ_{m} =  4.816 87

Gini coefficient  G =  0.752 201

Balanced inequality ratio  P =  0.196 535

Left balanced inequality ratio  P_{1} =  0.143 971

Right balanced inequality ratio  P_{2} =  0.264 016

Relative edge distribution entropy  H_{er} =  0.854 894

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

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

pvalue  p =  0.000 00

Left tail power law exponent with p  γ_{3,1} =  1.831 00

Left pvalue  p_{1} =  0.000 00

Right tail power law exponent with p  γ_{3,2} =  2.141 00

Right pvalue  p_{2} =  0.000 00

Degree assortativity  ρ =  −0.057 574 8

Degree assortativity pvalue  p_{ρ} =  0.000 00

Spectral norm  α =  147.958

Algebraic connectivity  a =  0.010 442 0

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.466 78

Controllability  C =  295,185

Relative controllability  C_{r} =  0.662 145

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]

CaiNicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen.
Improving recommendation lists through topic diversification.
In Proc. Int. World Wide Web Conf., pages 22–32, 2005.
