| Literature DB >> 26064611 |
Stefanie Gazda1, Swami Iyer2, Timothy Killingback3, Richard Connor4, Solange Brault1.
Abstract
Network analysis has proved to be a valuable tool for studying the behavioural patterns of complex social animals. Often such studies either do not distinguish between different behavioural states of the organisms or simply focus attention on a single behavioural state to the exclusion of all others. In either of these approaches it is impossible to ascertain how the behavioural patterns of individuals depend on the type of activity they are engaged in. Here we report on a network-based analysis of the behavioural associations in a population of bottlenose dolphins (Tursiops truncatus) in Cedar Key, Florida. We consider three distinct behavioural states-socializing, travelling and foraging-and analyse the association networks corresponding to each activity. Moreover, in constructing the different activity networks we do not simply record a spatial association between two individuals as being either present or absent, but rather quantify the degree of any association, thus allowing us to construct weighted networks describing each activity. The results of these weighted activity networks indicate that networks can reveal detailed patterns of bottlenose dolphins at the population level; dolphins socialize in large groups with preferential associations; travel in small groups with preferential associates; and spread out to forage in very small, weakly connected groups. There is some overlap in the socialize and travel networks but little overlap between the forage and other networks. This indicates that the social bonds maintained in other activities are less important as they forage on dispersed, solitary prey. The overall network, not sorted by activity, does not accurately represent any of these patterns.Entities:
Keywords: behaviour; bottlenose dolphin; network
Year: 2015 PMID: 26064611 PMCID: PMC4448833 DOI: 10.1098/rsos.140263
Source DB: PubMed Journal: R Soc Open Sci ISSN: 2054-5703 Impact factor: 2.963
Definitions of network metrics, their biological significance in the context of the behavioural networks of dolphins and relevant references.
| network concept | definition | biological significance | reference(s) |
|---|---|---|---|
| average degree | the degree of a vertex is the number of edges incident on it. The average degree of a network is the average value taken over all the vertices in the network | high average degree means each dolphin on average interacts with many other dolphins | [ |
| average strength | the strength of a vertex is the sum of the weights of the edges incident on it. The average strength of a network is the average value over all the vertices in the network | high average strength means each dolphin on average interacts strongly with its neighbours | [ |
| average edge weight | the average edge weight of a network is the average value of the edge weights over all the edges in the network | high average edge weight means that on average each pair of dolphins that interact with one another do so strongly. We used HWI values as edge weights | [ |
| number of connected components | the total number of components, where each component is a set of vertices that are linked to each other by paths | large number of connected components means that there is a large number of dolphins with possible associations within the component they are in but no associations across | [ |
| average clustering coefficient | the clustering coefficient of a vertex is the ratio of the number of edges between the vertices connected to it to the number of edges that could possibly exist between them. The average clustering coefficient of a network is the average value over all vertices in the network | large average clustering coefficient means pairs of dolphins that interact with a particular dolphin are likely to interact with one another | [ |
| number of communities | the total number of communities where each community is a collection of vertices that are highly connected among themselves but with few or weak edges to vertices outside the collection. Communities within a network can be identified using the WalkTrap algorithm, which is based on the fact that a random walker tends to get trapped in dense parts of a network corresponding to communities | large number of communities means large number of groups of dolphins with strong intra-group connections and weak inter-group connections | [ |
| average community size | the average number of vertices in a community | large average community size means each community on average has many dolphins with connections among themselves | [ |
| community overlap | the distance between the partitions representing communities in networks, measured as the variation of information or shared information distance between the partitions | large community overlap means that dolphins that tend to associate closely with each other in one network also associate closely in the other | [ |
Results from SocProg [64] analysis of preferential associations among dolphins in the overall network, the socialize network, the travel network and the forage network, using an inclusion threshold of three sightings. (Realvalues are compared with random values (permuted 200 000 times per network). The mean, standard deviation (s.d.) and coefficient of variation (CV) of the HWI values are shown along with the p-value indicating whether the associations are significant. Values in italics indicate significant preferential associations.)
| association indices | ||||
|---|---|---|---|---|
| real | random | |||
| overall network | mean | 0.03312 | 0.03558 | |
| s.d. | 0.08157 | 0.06967 | 0.99999 | |
| CV | 2.46307 | 1.95818 | 1 | |
| forage network | mean | 0.04186 | 0.04181 | 0.53489 |
| s.d. | 0.11154 | 0.09057 | 0.99999 | |
| CV | 2.66463 | 2.16634 | 0.99999 | |
| socialize network | mean | 0.18217 | 0.18762 | |
| s.d. | 0.20699 | 0.17423 | 1 | |
| CV | 1.13628 | 0.92884 | 0.99999 | |
| travel network | mean | 0.0596 | 0.06184 | |
| s.d. | 0.1317 | 0.11237 | 0.99999 | |
| CV | 2.20953 | 1.81724 | 1 | |
Basic network quantities for the overall network, the socialize network, the travel network and the forage network. (Mann–Whitney U-tests of group size indicated significant differences in group size between each pair of networks (italics, p-value<0.003) except for travel to overall (p-value>0.562). Metrics (average degree, average strength, average edge weight, number of connected components, average clustering coefficient, number of communities, average community size) were tested using an edge rearrangement randomization test. Values in italics are statistically significant (p-value<0.003).)
| number of sightings | number of vertices | number of edges | average group size | average degree | average strength | average edge weight | number of connected components | average clustering coefficient | number of communities | average community size | |
|---|---|---|---|---|---|---|---|---|---|---|---|
| overall network | 303 | 147 | 2088 | ||||||||
| socialize network | 38 | 42 | 458 | 4 | 10.5 | ||||||
| travel network | 77 | 53 | 302 | 6.625 | |||||||
| forage network | 153 | 76 | 462 | 3.140 |
Pairwise community structure overlap for the overall network, the socialize network, the travel network and the forage network. (The smaller the numeric value, the larger the overlap.)
| overall network | socialize network | travel network | forage network | |
|---|---|---|---|---|
| overall network | 0 | 4.908 | 5.382 | 5.534 |
| socialize network | 4.908 | 0 | 3.031 | 4.686 |
| travel network | 5.382 | 3.031 | 0 | 5.278 |
| forage network | 5.534 | 4.686 | 5.278 | 0 |