Dolphins

This is a directed social network of bottlenose dolphins. The nodes are the bottlenose dolphins (genus Tursiops) of a bottlenose dolphin community living off Doubtful Sound, a fjord in New Zealand (spelled fiord in New Zealand). An edge indicates a frequent association. The dolphins were observed between 1994 and 2001.

Metadata

CodeDO
Internal namedolphins
NameDolphins
Data sourcehttp://www-personal.umich.edu/~mejn/netdata/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Animal network
Dataset timestamp 1994 ⋯ 2001
Node meaningDolphin
Edge meaningAssociation
Network formatUnipartite, undirected
Edge typeUnweighted, no multiple edges
LoopsDoes not contain loops

Statistics

Size n =62
Volume m =159
Loop count l =0
Wedge count s =923
Claw count z =1,861
Cross count x =2,769
Triangle count t =95
Square count q =278
4-Tour count T4 =6,234
Maximum degree dmax =12
Average degree d =5.129 03
Fill p =0.084 082 5
Size of LCC N =62
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.836 59
90-Percentile effective diameter δ0.9 =5.052 29
Median distance δM =3
Mean distance δm =3.454 33
Gini coefficient G =0.325 015
Balanced inequality ratio P =0.386 792
Relative edge distribution entropy Her =0.957 397
Power law exponent γ =1.708 53
Tail power law exponent γt =7.711 00
Tail power law exponent with p γ3 =7.711 00
p-value p =0.469 000
Degree assortativity ρ =−0.043 594 0
Degree assortativity p-value pρ =0.438 517
Clustering coefficient c =0.308 776
Spectral norm α =7.193 61
Algebraic connectivity a =0.172 973
Spectral separation |λ1[A] / λ2[A]| =1.211 80
Non-bipartivity bA =0.468 830
Normalized non-bipartivity bN =0.286 231
Algebraic non-bipartivity χ =0.528 476
Spectral bipartite frustration bK =0.025 759 0
Controllability C =6
Relative controllability Cr =0.096 774 2

Plots

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

Clustering coefficient distribution

Average neighbor degree distribution

SynGraphy

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] D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. and Sociobiol., 54:396–405, 2003.