Animal social networks as intersections graphs of random walks

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Cermelli, Paolo, Marchese, Silvia, Sacerdote, Laura, Zucca, Cristina
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909902071398400
author Cermelli, Paolo
Marchese, Silvia
Sacerdote, Laura
Zucca, Cristina
author_facet Cermelli, Paolo
Marchese, Silvia
Sacerdote, Laura
Zucca, Cristina
contents We study here the social network generated by the asynchronous visits, to a fixed set of sites, of mobile agents modelled as independent random walks on the plane lattice. The social network is constructed by assuming that a group of agents are associated if they have visited the same set of sites within a finite time interval. This construction is an instance of a random intersection graph, and has been used in the literature to study association networks in a number of animal species. We characterize the mathematical structure of these networks, which we view as one-mode projections of suitable bipartite graphs or, equivalently, as 2-sections of the corresponding hypergraphs. We determine analytically the probability distribution of the random bipartite graphs and hypergraphs associated to this construction, and suggest that association networks generated by the use of common resources are better described by hypergraphs rather than simple projected graphs, that miss important information regarding the actual associations among the agents.
format Preprint
id arxiv_https___arxiv_org_abs_2511_11130
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Animal social networks as intersections graphs of random walks
Cermelli, Paolo
Marchese, Silvia
Sacerdote, Laura
Zucca, Cristina
Physics and Society
Probability
Populations and Evolution
05C80, 05C82, 05C90, 60J20, 91D30, 92D50
We study here the social network generated by the asynchronous visits, to a fixed set of sites, of mobile agents modelled as independent random walks on the plane lattice. The social network is constructed by assuming that a group of agents are associated if they have visited the same set of sites within a finite time interval. This construction is an instance of a random intersection graph, and has been used in the literature to study association networks in a number of animal species. We characterize the mathematical structure of these networks, which we view as one-mode projections of suitable bipartite graphs or, equivalently, as 2-sections of the corresponding hypergraphs. We determine analytically the probability distribution of the random bipartite graphs and hypergraphs associated to this construction, and suggest that association networks generated by the use of common resources are better described by hypergraphs rather than simple projected graphs, that miss important information regarding the actual associations among the agents.
title Animal social networks as intersections graphs of random walks
topic Physics and Society
Probability
Populations and Evolution
05C80, 05C82, 05C90, 60J20, 91D30, 92D50
url https://arxiv.org/abs/2511.11130