SearcharxivSearch

arXiv · 2302.01919

Critical numerosity in collective behavior

Abstract

Natural collectives, despite comprising individuals who may not know their numerosity, can exhibit behaviors that depend sensitively on it. This paper proves that the collective behavior of number-oblivious individuals can even have a critical numerosity, above and below which it qualitatively differs. We formalize the concept of critical numerosity in terms of a family of zero--one laws and introduce a model of collective motion, called chain activation and transport (CAT), that has one. CAT describes the collective motion of $n \geq 2$ individuals as a Markov chain that rearranges $n$-element subsets of the $d$-dimensional grid, $m < n$ elements at a time. According to the individuals' dynamics, with each step, CAT removes $m$ elements from the set and then progressively adds $m$ elements to the boundary of what remains, in a way that favors the consecutive addition and removal of nearby elements. This paper proves that, if $d \geq 3$, then CAT has a critical numerosity of $n_c = 2m+2$ with respect to the behavior of its diameter. Specifically, if $n < n_c$, then the elements form one "cluster," the diameter of which has an a.s.--finite limit infimum. However, if $n \geq n_c$, then there is an a.s.--finite time at which the set consists of clusters of between $m+1$ and $2m+1$ elements, and forever after which these clusters grow apart, resulting in unchecked diameter growth. The existence of critical numerosities means that collectives can exhibit "phase transitions" that are governed purely by their numerosity and not, for example, their density or the strength of their interactions. This fact challenges prevalent beliefs about collective behavior and suggests new functionality for programmable matter. More broadly, it demonstrates an opportunity to explore the possible behaviors collectives through the study of random processes that rearrange sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacob Calvert. 2023-02-03. Critical numerosity in collective behavior. https://arxiv.org/abs/2302.01919

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