Residence hall

This directed network contains friendship ratings between 217 residents living at a residence hall located on the Australian National University campus. A node represents a person and


Internal namemoreno_oz
NameResidence hall
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Human social network
Node meaningPerson
Edge meaningFriendship
Network formatUnipartite, directed
Edge typePositive weights, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops


Size n =217
Volume m =2,672
Loop count l =0
Wedge count s =35,859
Claw count z =848,578
Cross count x =8,287,727
Triangle count t =3,629
Square count q =35,657
4-Tour count T4 =432,370
Maximum degree dmax =80
Maximum outdegree d+max =51
Maximum indegree dmax =34
Average degree d =24.626 7
Fill p =0.057 006 3
Size of LCC N =217
Size of LSCC Ns =214
Relative size of LSCC Nrs =0.986 175
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.807 59
90-Percentile effective diameter δ0.9 =2.785 73
Median distance δM =2
Mean distance δm =2.327 48
Gini coefficient G =0.244 081
Relative edge distribution entropy Her =0.981 563
Power law exponent γ =1.492 83
Tail power law exponent γt =6.321 00
Degree assortativity ρ =+0.095 962 5
Degree assortativity p-value pρ =5.500 55 × 10−9
In/outdegree correlation ρ± =+0.480 021
Clustering coefficient c =0.303 606
Directed clustering coefficient c± =0.302 612
Spectral norm α =107.958
Operator 2-norm ν =57.034 8
Cyclic eigenvalue π =50.874 7
Algebraic connectivity a =5.353 63
Reciprocity y =0.623 503
Non-bipartivity bA =0.664 996
Normalized non-bipartivity bN =0.572 754
Algebraic non-bipartivity χ =1.783 97
Spectral bipartite frustration bK =0.026 313 3


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

Edge weight/multiplicity distribution

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] Linton Clarke Freeman, Cynthia Marie Webster, and Deirdre M. Kirke. Exploring social structure using dynamic three-dimensional color images. Soc. Netw., 20(2):109–118, 1998.