Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.19622

Percolative MDLA: phase transition and critical behaviour

Eviatar B. Procaccia·Haoyu Wang·Yuan Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we introduce the model of Percolative MDLA (PMDLA) on $\mathbb{Z}^2$ which engulfs the entire occupied percolation component of each particle that reaches the aggregate. We prove a phase transition of finite time explosion, as a function of the particle density $λ$, where the critical value equals $λ_c=-\log(1-p_c^{\rm site}(\mathbb{Z}^2))$. Below $λ_c$, the process is nonexplosive and has a linear upper bound on its radius. For $2/3<λ<λ_c$, it also has a linear lower bound on the growth rate. Above $λ_c$, an infinite component is swallowed in finite time a.s. At $λ_c$, every update is finite, but the updates accumulate in finite time, causing a blowup. Excluding criticality, the results are generalized to all higher dimensions.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eviatar B. Procaccia, Haoyu Wang, Yuan Zhang. 2026-10-14. Percolative MDLA: phase transition and critical behaviour. https://arxiv.org/abs/2610.19622

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

KEEP EXPLORING

Related papers

arXiv2026

Loglinear Hawkes processes: existence, nonexplosion, stability and moment bounds

This paper discusses a special class of nonlinear Hawkes processes, where the rate function is the exponential function. We call these processes loglinear Hawkes processes. Such processes are used with success in computational neuroscience and we provide a mathematical background for them. After obtaining existence from a standard Poisson embedding, we give sufficient conditions for explosion and nonexplosion that cover a large class of memory functions. In order to give sufficient stability conditions, we construct an autoregressive integer-valued time series that gives pathwise upper bounds for the bin counts of a loglinear Hawkes process. From here, a Markov chain argument shows that the regeneration time for a loglinear Hawkes process has finite expectation if the memory function is negative enough in a neighborhood of zero. Stability in total variation follows. Finally, we show that both the loglinear Hawkes process under a large class of initial conditions and its stationary version have finite exponential moments.

math.PR↗
arXiv2026

Eddy viscosity by Lévy transport noises

We consider stochastic linear transport equations in dimension $d\geq 2$ and stochastic 2D Euler equations with $L^2$-initial condition, both driven by Lévy transport noise in the Marcus sense. Under a suitable scaling limit of the noises, we prove that the solutions to the stochastic linear transport equations converge to the solution of the deterministic heat equation, while weak solutions to the stochastic 2D Euler equations converge weakly to the unique solution of the deterministic 2D Navier--Stokes equation. These results show that small-scale jump noises generate eddy viscosity, extending the recent studies on Itô--Stratonovich diffusion limits to the discontinuous setting.

math.PR↗
arXiv2026

Triggered urn models for frequently asked questions (FAQ)

We investigate a nonclassic urn model with triggers that increase the number of colors. The scheme has emerged as a model for web services that set up frequently asked questions (FAQ). We present a thorough asymptotic analysis of the FAQ urn scheme in generality that covers a large number of special cases, such as Simon's urn. For instance, we consider time dependent triggering probabilities. We identify regularity conditions on these probabilities that classify the schemes into those where the number of colors in the urn remains almost surely finite or increases to infinity and conditions that tell us whether all the existing colors are observed infinitely often or not. We determine the rank curve, too. In view of the broad generality of the trigger probabilities, a spectrum of limit distributions appears, from central limit theorems to Poisson approximation, to power-laws, revealing connections to Heaps exponent and Zipf's law. A combinatorial approach to the Simon urn is presented to indicate the possibility of such exact analysis, which is important for short-term predictions. Extensive simulations on real datasets (from Amazon sales) as well as computer-generated data clearly indicate that the asymptotic and exact theory developed agrees with practice.

math.PR↗