konect logo
KONECT
KONECT > Networks > Sampson

Sampson

About this network

This directed network contains ratings between monks related to a crisis in a cloister (or monastery) in New English (USA) which lead to a 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.

Network info

CodeMs
Category HumanSocial
Data source http://moreno.ss.uci.edu/data.html#sampson
Vertex type Monk
Edge type Ratings
FormatDirected: Edges are directed Directed
Edge weightsSigned: Positive and negative edges Signed
Metadata Zero weights:  Edges may have a weight of zero Zero weight
Size18 vertices (monks)
Volume189 edges (ratingss)
Average degree (overall)21.000 edges / vertex
Fill0.61765 edges / vertex2
Maximum degree28 edges
Reciprocity66.7%
Size of LCC18 vertices (network is connected)
Size of LSCC18 vertices (network is strongly connected)
Wedge count1,683
Claw count26,686
Triangle count479
Square count4,449
4-tour count42,576
Power law exponent (estimated) with dmin8.9910 (dmin = 14)
Gini coefficient10.3%
Relative edge distribution entropy99.3%
Assortativity–0.080428
Clustering coefficient85.4%
Diameter2 edges
90-percentile effective diameter1.44 edges
Mean shortest path length1.12 edges
Spectral norm10.762
Algebraic connectivity8.4886
Degree distribution of the Sampson network
Degree distribution
Outdegree distribution of the Sampson network
Outdegree distribution
Indegree distribution of the Sampson network
Indegree distribution
Degree distribution of the Sampson network
Degree distribution
Outdegree distribution of the Sampson network
Outdegree distribution
Indegree distribution of the Sampson network
Indegree distribution

Out/indegree comparison

Out/indegree comparison of the Sampson network
Out/indegree comparison
Degree distribution of the Sampson network
Degree distribution
Outdegree distribution of the Sampson network
Outdegree distribution
Indegree distribution of the Sampson network
Indegree distribution
Degree distribution of the Sampson network
Degree distribution
Outdegree distribution of the Sampson network
Outdegree distribution
Indegree distribution of the Sampson network
Indegree distribution
Clustering coefficient distribution of the Sampson network
Clustering coefficient distribution
Distance distribution of the Sampson network
Distance distribution
Distance distribution on a logistic scale of the Sampson network
Distance distribution on a logistic scale
Top-k eigenvalues of A of the Sampson network
Top-k eigenvalues of A
Top-k eigenvalues of N of the Sampson network
Top-k eigenvalues of N
Top-k eigenvalues of L of the Sampson network
Top-k eigenvalues of L
Spectral distribution of the eigenvalues of A of the Sampson network
Spectral distribution of the eigenvalues of A
Spectral distribution of the eigenvalues of N of the Sampson network
Spectral distribution of the eigenvalues of N
Spectral distribution of the eigenvalues of L of the Sampson network
Spectral distribution of the eigenvalues of L
Cumulative spectral distribution of A of the Sampson network
Cumulative spectral distribution of A
Cumulative spectral distribution of N of the Sampson network
Cumulative spectral distribution of N
Cumulative spectral distribution of L of the Sampson network
Cumulative spectral distribution of L
Eigenvectors of A of the Sampson network
Eigenvectors of A
Eigenvectors of L of the Sampson network
Eigenvectors of L
Complex eigenvalues of the asymmetric adjacency matrix of the Sampson network
Complex eigenvalues of the asymmetric adjacency matrix

Layout

Layout of the Sampson network
Layout

Downloads

TSV file:downloadmoreno_sampson.tar.bz2 (2.18 KiB)
Extraction code:downloadmoreno.tar.bz2 (21.10 KiB)

References

[1] Sampson network dataset -- KONECT, October 2016. [ 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 Mathematical Psychology, 12(3):328--383, 1975.
[3] Samuel F Sampson. Crisis in a Cloister. PhD thesis, PhD Thesis. Cornell University, Ithaca, 1969.

BibTeX