CiaoDVD trust

This is the user–user trust network of the site from 2013.


Internal namelibrec-ciaodvd-trust
NameCiaoDVD trust
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Online social network
Dataset timestamp 2013
Node meaningUser
Edge meaningTrust rating
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops
Snapshot Is a snapshot and likely to not contain all data


Size n =4,658
Volume m =40,133
Loop count l =0
Wedge count s =2,614,007
Claw count z =247,680,289
Cross count x =13,147,053,018
Triangle count t =156,501
Square count q =9,178,144
4-Tour count T4 =83,947,412
Maximum degree dmax =419
Maximum outdegree d+max =100
Maximum indegree dmax =361
Average degree d =17.231 9
Fill p =0.001 850 10
Size of LCC N =4,562
Size of LSCC Ns =1,032
Relative size of LSCC Nrs =0.221 554
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.273 89
90-Percentile effective diameter δ0.9 =4.421 73
Median distance δM =4
Mean distance δm =3.743 68
Gini coefficient G =0.785 007
Relative edge distribution entropy Her =0.844 275
Power law exponent γ =1.745 98
Tail power law exponent γt =1.551 00
Degree assortativity ρ =+0.103 916
Degree assortativity p-value pρ =2.136 28 × 10−158
In/outdegree correlation ρ± =+0.551 072
Clustering coefficient c =0.179 610
Directed clustering coefficient c± =0.195 143
Spectral norm α =129.218
Operator 2-norm ν =70.147 7
Cyclic eigenvalue π =59.518 3
Algebraic connectivity a =0.107 634
Reciprocity y =0.349 687
Non-bipartivity bA =0.790 358
Normalized non-bipartivity bN =0.062 702 3
Algebraic non-bipartivity χ =0.107 350
Spectral bipartite frustration bK =0.001 851 79


Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Double Laplacian graph drawing

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution


Matrix decompositions plots



[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] Guobing Guo, Jie Zhang, Daniel Thalmann, and Neil Yorke-Smith. ETAF: An extended trust antecedents framework for trust prediction. In Proc. Int. Conf. Adv. in Soc. Netw. Anal. and Min., pages 540–547, 2014.