Bitcoin OTC
This is a user–user trust/distrust network, from the Bitcoin OTC platform, on
which Bitcoins are traded. Each directed edge represents trust or distrust on
a scale from −10 to +10. Positive edge weights denote trust, and negative
edge weights denote distrust. An edge weight of zero does not appear.
Metadata
Statistics
Size  n =  5,881

Volume  m =  35,592

Loop count  l =  0

Wedge count  s =  1,696,179

Claw count  z =  811,596,829

Cross count  x =  175,418,444,313

Triangle count  t =  33,493

Square count  q =  1,043,996

4Tour count  T_{4} =  15,179,668

Maximum degree  d_{max} =  1,298

Maximum outdegree  d^{+}_{max} =  763

Maximum indegree  d^{−}_{max} =  535

Average degree  d =  12.104 1

Fill  p =  0.001 029 26

Size of LCC  N =  5,875

Size of LSCC  N_{s} =  4,709

Relative size of LSCC  N^{r}_{s} =  0.800 714

Diameter  δ =  9

50Percentile effective diameter  δ_{0.5} =  3.037 71

90Percentile effective diameter  δ_{0.9} =  3.996 62

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  3.558 34

Gini coefficient  G =  0.715 474

Balanced inequality ratio  P =  0.217 956

Outdegree balanced inequality ratio  P_{+} =  0.220 190

Indegree balanced inequality ratio  P_{−} =  0.227 748

Relative edge distribution entropy  H_{er} =  0.856 811

Power law exponent  γ =  1.968 88

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

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

pvalue  p =  0.000 00

Outdegree tail power law exponent with p  γ_{3,o} =  2.061 00

Outdegree pvalue  p_{o} =  0.000 00

Indegree tail power law exponent with p  γ_{3,i} =  2.271 00

Indegree pvalue  p_{i} =  0.004 000 00

Degree assortativity  ρ =  −0.164 834

Degree assortativity pvalue  p_{ρ} =  1.857 77 × 10^{−259}

In/outdegree correlation  ρ^{±} =  +0.890 664

Clustering coefficient  c =  0.059 238 4

Directed clustering coefficient  c^{±} =  0.055 367 2

Spectral norm  α =  292.694

Operator 2norm  ν =  205.822

Cyclic eigenvalue  π =  118.316

Algebraic connectivity  a =  0.253 255

Reciprocity  y =  0.792 313

Nonbipartivity  b_{A} =  0.481 386

Normalized nonbipartivity  b_{N} =  0.039 855 0

Spectral bipartite frustration  b_{K} =  0.002 490 44

Negativity  ζ =  0.100 107

Algebraic conflict  ξ =  0.140 294

Triadic conflict  τ =  0.127 519

Spectral signed frustration  φ =  0.004 875 71

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]

Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian, and Christos Faloutsos.
Edge weight prediction in weighted signed networks.
In Proc. Int. Conf. Data Min., pages 221–230, 2016.
