BookCrossing (ratings)
This is the bipartite book rating network of the BookCrossing community.
Rating values are integers between one and ten, where ten represents the best
score. An edge shows that a user has rated a book. Nodes in the left column are
users; nodes in the right column are books.
Metadata
Statistics
Size  n =  263,757

Left size  n_{1} =  77,802

Right size  n_{2} =  185,955

Volume  m =  433,652

Wedge count  s =  80,944,469

Claw count  z =  141,344,884,260

Cross count  x =  268,754,486,843,948

Square count  q =  1,457,330

4Tour count  T_{4} =  336,304,276

Maximum degree  d_{max} =  8,524

Maximum left degree  d_{1max} =  8,524

Maximum right degree  d_{2max} =  707

Average degree  d =  3.288 27

Average left degree  d_{1} =  5.573 79

Average right degree  d_{2} =  2.332 03

Fill  p =  2.997 39 × 10^{−5}

Size of LCC  N =  229,137

Diameter  δ =  23

50Percentile effective diameter  δ_{0.5} =  5.156 19

90Percentile effective diameter  δ_{0.9} =  6.923 03

Median distance  δ_{M} =  6

Mean distance  δ_{m} =  5.649 99

Gini coefficient  G =  0.662 876

Balanced inequality ratio  P =  0.237 367

Left balanced inequality ratio  P_{1} =  0.199 243

Right balanced inequality ratio  P_{2} =  0.298 022

Relative edge distribution entropy  H_{er} =  0.894 421

Power law exponent  γ =  3.146 62

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

Degree assortativity  ρ =  −0.058 945 9

Degree assortativity pvalue  p_{ρ} =  0.000 00

Spectral norm  α =  152.914

Algebraic connectivity  a =  6.929 46 × 10^{−5}

Spectral separation  λ_{1}[A] / λ_{2}[A] =  2.285 97

Negativity  ζ =  0.455 700

Algebraic conflict  ξ =  0.005 160 59

Spectral signed frustration  φ =  0.000 357 269

Controllability  C =  149,758

Relative controllability  C_{r} =  0.567 788

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.
