SearcharxivSearch

arXiv · 2508.08613

Ballistic aggregation displays self-organized criticality

Abstract

Consider the convex hull of a collection of disjoint open discs with radii $1/2$. The boundary of the convex hull consists of a finite number of line segments and arcs. Randomly choose a point in one of the arcs in the boundary so that the density of its distribution is proportional to the arc measure. Attach a new disc at the chosen point so that it is outside of the convex hull and tangential to its boundary. Replace the original convex hull with the convex hull of all preexisting discs and the new disc. Continue in the same manner. Simulations show that disc clusters form long, straight, or slightly curved filaments with small side branches and occasional macroscopic side branches. The shape of the convex hull is either an equilateral triangle or a quadrangle. Side branches play the role analogous to avalanches in sandpile models, one of the best-known examples of self-organized criticality (SOC). Our results indicate that the size of a branch obeys a power law, as expected of avalanches in sandpile models and similar ``catastrophies'' in other SOC models.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Burdzy. 2025-08-12. Ballistic aggregation displays self-organized criticality. https://arxiv.org/abs/2508.08613

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