Super User

These are interactions from the StackExchange site "Super User". The network is between users, and directed edges represent three types of interactions: answering a question of another user, commenting on another user's question, and commenting on another user's answer. The network is temporal. This network is part of a series of network from multiple StackExchange sites.


Internal namesx-superuser
NameSuper User
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Online contact network
Node meaningUser
Edge meaningAnswer/comment
Network formatUnipartite, directed
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops
Snapshot Is a snapshot and likely to not contain all data


Size n =194,085
Volume m =1,443,339
Unique edge count m̿ =924,886
Wedge count s =436,408,980
Claw count z =1,143,167,932,217
Triangle count t =1,543,161
Square count q =230,363,003
4-Tour count T4 =3,589,969,084
Maximum degree dmax =27,637
Maximum outdegree d+max =26,996
Maximum indegree dmax =9,576
Average degree d =14.873 3
Fill p =2.455 30 × 10−5
Average edge multiplicity m̃ =1.560 56
Size of LCC N =189,191
Size of LSCC Ns =83,813
Relative size of LSCC Nrs =0.431 837
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.297 42
90-Percentile effective diameter δ0.9 =4.361 21
Median distance δM =4
Mean distance δm =3.789 27
Gini coefficient G =0.793 528
Balanced inequality ratio P =0.184 874
Outdegree balanced inequality ratio P+ =0.168 213
Indegree balanced inequality ratio P =0.221 058
Power law exponent γ =1.985 17
Degree assortativity ρ =−0.093 553 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.705 078
Clustering coefficient c =0.010 608 1
Directed clustering coefficient c± =0.016 064 2
Spectral norm α =7,265.84
Operator 2-norm ν =3,634.95
Cyclic eigenvalue π =3,630.45
Algebraic connectivity a =0.065 565 0
Reciprocity y =0.378 558
Non-bipartivity bA =0.984 410
Normalized non-bipartivity bN =0.036 249 7
Algebraic non-bipartivity χ =0.064 935 7
Spectral bipartite frustration bK =0.001 965 33
Controllability C =91,710
Relative controllability Cr =0.472 525


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

In/outdegree scatter plot

Edge weight/multiplicity distribution

Clustering coefficient distribution

Average neighbor degree distribution

Temporal distribution

Diameter/density evolution


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] Jure Leskovec. Stanford Network Analysis Project., September 2014.