SearcharxivSearch

arXiv · 2602.07763

Rate of divergence of time constant for frog model with vanishing initial density

Abstract

The frog model with a Bernoulli initial configuration is an interacting particle system on the $d$-dimensional lattice ($d \geq 2$) with two types of particles: active and sleeping. Active particles perform independent simple random walks. In contrast, although the sleeping particles do not move at first, they become active and start moving once touched by the active particles. Initially, only the origin has a single active particle, and the other sites have sleeping particles according to a Bernoulli distribution. After the original active particle starts moving, further active particles are gradually generated under the above rule and propagate across the lattice. The time required for the propagation of active frogs is expected to increase as the parameter of the Bernoulli distribution decreases, since fewer frogs are available. The aim of this paper is to investigate this increase in the vanishing density limit. In particular, we observe that it diverges and the rate of divergence differs significantly between $d=2$ and $d \geq 3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryoki Fukushima, Naoki Kubota. 2026-02-08. Rate of divergence of time constant for frog model with vanishing initial density. https://arxiv.org/abs/2602.07763

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