Self-segregation in heterogeneous metapopulation landscapes

Emergence of power-law distributions in self-segregation reaction-diffusion processes

Many natural or human-made systems encompassing local reactions and diffusion processes exhibit spatially distributed patterns of some relevant dynamical variable. These interactions, through self-organization and critical phenomena, give rise to power-law distributions, where emergent patterns and structures become visible across vastly different scales. Recent observations reveal power-law distributions in the spatial organization of, e.g., tree clusters and forest patch sizes. Crucially, these patterns do not follow a spatially periodic order but rather a statistical one. Unlike the spatially periodic patterns elucidated by the Turing mechanism, the statistical order of these particular vegetation patterns suggests an incomplete understanding of the underlying mechanisms. Here, we present a self-segregation mechanism, driving the emergence of power-law scalings in pattern-forming systems. The model incorporates an Allee-logistic reaction term, responsible for the local growth, and a nonlinear diffusion process accounting for positive interactions and limited resources. According to a self-organized criticality (SOC) principle, after an initial decrease, the system mass reaches an analytically predictable threshold, beyond which it self-segregates into distinct clusters, due to local positive interactions that promote cooperation. Numerical investigations show that the distribution of cluster sizes obeys a power law with an exponential cutoff.

From random walks on networks to nonlinear diffusion

Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great impact on the collective movement of the group. For this reason, many models in mathematical biology have incorporated crowding effects and managed to understand their implications. Here, we build on a previously developed framework for random walks on networks to show that in the continuum limit, the underlying stochastic process can be identified with a diffusion partial differential equation. The diffusion coefficient of the emerging equation is, in general, density dependent, and can be directly related to the transition probabilities of the random walk. Moreover, the relaxation time of the stochastic process is directly linked to the diffusion coefficient and also to the network structure, as it usually happens in the case of linear diffusion. As a specific example, we study the equivalent of a porous-medium-type equation on networks, which shows similar properties to its continuum equivalent. For this equation, self-similar solutions on a lattice and on homogeneous trees can be found, showing finite speed of propagation in contrast to commonly used linear diffusion equations. These findings also provide insights into reaction-diffusion systems with general diffusion operators, which have appeared recently in some applications.