Crisis in a Cloister

This directed network contains ratings between monks related to a crisis in a cloister (or monastery) in New England (USA) which lead to the departure of several of the monks. This dataset aggregates several available ratings ((dis)esteem, (dis)liking, positive/negative influence, praise/blame) into only one rating, which is positive if all original ratings were positive and negative if all original ratings were negative. If there were mixed opinions the rating has the value 0. A node represents a monk and an edge between two monks shows that the left monk rated the right monk.


Internal namemoreno_sampson
NameCrisis in a Cloister
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Human social network
Node meaningMonk
Edge meaningRatings
Network formatUnipartite, directed
Edge typeSigned, possibly weighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsDoes not contain loops
Zero weights Edges may have weight zero


Size n =18
Volume m =189
Loop count l =0
Wedge count s =1,683
Claw count z =24,660
Cross count x =119,784
Triangle count t =479
Square count q =4,313
4-Tour count T4 =41,382
Maximum degree dmax =28
Maximum outdegree d+max =15
Maximum indegree dmax =16
Average degree d =21.000 0
Fill p =0.601 307
Size of LCC N =18
Size of LSCC Ns =18
Relative size of LSCC Nrs =1.000 00
Diameter δ =2
50-Percentile effective diameter δ0.5 =0.580 709
90-Percentile effective diameter δ0.9 =1.438 98
Median distance δM =1
Mean distance δm =1.123 87
Gini coefficient G =0.107 186
Balanced inequality ratio P =0.423 913
Outdegree balanced inequality ratio P+ =0.402 174
Indegree balanced inequality ratio P =0.434 783
Relative edge distribution entropy Her =0.992 852
Power law exponent γ =2.495 76
Tail power law exponent γt =8.991 00
Degree assortativity ρ =−0.079 268 1
Degree assortativity p-value pρ =0.211 656
In/outdegree correlation ρ± =+0.115 657
Clustering coefficient c =0.853 832
Directed clustering coefficient c± =0.655 719
Spectral norm α =10.907 0
Operator 2-norm ν =7.119 74
Cyclic eigenvalue π =4.040 28
Algebraic connectivity a =9.952 07
Spectral separation 1[A] / λ2[A]| =1.052 39
Reciprocity y =0.641 304
Non-bipartivity bA =0.727 559
Normalized non-bipartivity bN =0.730 621
Algebraic non-bipartivity χ =6.265 51
Spectral bipartite frustration bK =0.112 779
Negativity ζ =0.472 826
Algebraic conflict ξ =7.496 84
Triadic conflict τ =0.380 062
Spectral signed frustration φ =0.153 345
Controllability C =0
Relative controllability Cr =0.000 00


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

Item rating evolution

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] Ronald L. Breiger, Scott A. Boorman, and Phipps Arabie. An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J. of Math. Psychol., 12(3):328–383, 1975.
[3] Samuel F. Sampson. Crisis in a Cloister. PhD thesis, Cornell Univ., 1969.