Advogato
This is the trust network of Advogato. Advogato is an online community platform
for developers of free software launched in 1999. Nodes are users of Advogato
and the directed edges represent trust relationships. A trust link is called a
"certification" on Advogato, and three different levels of certifications are
possible on Advogato, corresponding to three different edge weights:
certifications as apprentice (0.6), journeyer (0.8) and master (1.0). A user
without any trust certificate is called an observer. It is possible to trust
oneself on Advogato, and therefore the network contains loops.
Metadata
Statistics
| Size | n = | 6,541
|
| Volume | m = | 51,127
|
| Loop count | l = | 3,992
|
| Wedge count | s = | 3,197,651
|
| Claw count | z = | 466,990,179
|
| Cross count | x = | 71,381,614,071
|
| Triangle count | t = | 98,300
|
| Square count | q = | 3,571,636
|
| 4-Tour count | T4 = | 41,442,262
|
| Maximum degree | dmax = | 943
|
| Maximum outdegree | d+max = | 786
|
| Maximum indegree | d−max = | 722
|
| Average degree | d = | 15.632 8
|
| Fill | p = | 0.001 195 71
|
| Size of LCC | N = | 5,042
|
| Size of LSCC | Ns = | 3,140
|
| Relative size of LSCC | Nrs = | 0.480 049
|
| Diameter | δ = | 9
|
| 50-Percentile effective diameter | δ0.5 = | 2.730 57
|
| 90-Percentile effective diameter | δ0.9 = | 3.818 14
|
| Median distance | δM = | 3
|
| Mean distance | δm = | 3.287 99
|
| Gini coefficient | G = | 0.690 622
|
| Balanced inequality ratio | P = | 0.228 500
|
| Outdegree balanced inequality ratio | P+ = | 0.225 771
|
| Indegree balanced inequality ratio | P− = | 0.225 634
|
| Relative edge distribution entropy | Her = | 0.888 720
|
| Power law exponent | γ = | 1.683 19
|
| Tail power law exponent | γt = | 3.041 00
|
| Tail power law exponent with p | γ3 = | 3.041 00
|
| p-value | p = | 0.019 000 0
|
| Outdegree tail power law exponent with p | γ3,o = | 3.141 00
|
| Outdegree p-value | po = | 0.050 000 0
|
| Indegree tail power law exponent with p | γ3,i = | 3.121 00
|
| Indegree p-value | pi = | 0.583 000
|
| Degree assortativity | ρ = | −0.095 094 6
|
| Degree assortativity p-value | pρ = | 3.111 87 × 10−157
|
| In/outdegree correlation | ρ± = | +0.689 148
|
| Clustering coefficient | c = | 0.092 223 9
|
| Directed clustering coefficient | c± = | 0.123 560
|
| Spectral norm | α = | 75.557 9
|
| Operator 2-norm | ν = | 48.084 5
|
| Cyclic eigenvalue | π = | 26.458 5
|
| Algebraic connectivity | a = | 0.092 830 6
|
| Spectral separation | |λ1[A] / λ2[A]| = | 1.645 31
|
| Reciprocity | y = | 0.385 159
|
| Non-bipartivity | bA = | 0.603 415
|
| Normalized non-bipartivity | bN = | 0.130 758
|
| Algebraic non-bipartivity | χ = | 0.194 738
|
| Spectral bipartite frustration | bK = | 0.002 936 84
|
| Controllability | C = | 1,038
|
| Relative controllability | Cr = | 0.158 740
|
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]
|
Paolo Massa, Martino Salvetti, and Danilo Tomasoni.
Bowling alone and trust decline in social network sites.
In Proc. Int. Conf. Dependable, Auton. and Secure Comput.,
pages 658–663, 2009.
|
KONECT ‣ Networks ‣
Buy Me a Coffee
