SearcharxivSearch

arXiv · 1601.01023

Stochastic spatial model for the division of labor in social insects

Abstract

Motivated by the study of social insects, we introduce a stochastic model based on interacting particle systems in order to understand the effect of communication on the division of labor. Members of the colony are located on the vertex set of a graph representing a communication network. They are characterized by one of two possible tasks, which they update at a rate equal to the cost of the task they are performing by either defecting by switching to the other task or cooperating by anti-imitating a random neighbor in order to balance the amount of energy spent in each task. We prove that, at least when the probability of defection is small, the division of labor is poor when there is no communication, better when the communication network consists of a complete graph, but optimal on bipartite graphs with bipartite sets of equal size, even when both tasks have very different costs. This shows a non-monotonic relationship between the number of connections in the communication network and how well individuals organize themselves to accomplish both tasks equally.

Explore related subjects

Keep this discovery

BibTeXRIS

Alesandro Arcuri, Nicolas Lanchier. 2016-01-06. Stochastic spatial model for the division of labor in social insects. https://arxiv.org/abs/1601.01023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR