SearcharxivSearch

arXiv · 2405.17687

Random coverage from within with variable radii, and Johnson-Mehl cover times

Abstract

Given a compact planar region $A$, let $\tau_A$ be the (random) time it takes for the Johnson-Mehl tessellation of $A$ to be complete, i.e. the time it takes for $A$ to be fully covered by a spatial birth-growth process in $A$ with seeds arriving as a unit-intensity Poisson point process in $A \times [0,\infty)$, where upon arrival each seed grows at unit rate in all directions. We show that if $\partial A$ is smooth or polygonal then $\Pr [ \pi \tau_{sA}^3 - 6 \log s - 4 \log \log s \leq x]$ tends to $\exp(- (\frac{81}{4\pi})^{1/3} |A|e^{-x/3} -(\frac{9}{2\pi^2})^{1/3} |\partial A| e^{-x/6})$ in the large-$s$ limit; the second term in the exponent is due to boundary effects, the importance of which was not recognized in earlier work on this model. We present similar results in higher dimensions (where boundary effects dominate). These results are derived using new results on the asymptotic probability of covering $A$ with a high-intensity spherical Poisson Boolean model restricted to $A$ with grains having iid small random radii, which generalize recent work of the first author that dealt only with grains of deterministic radius.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathew D. Penrose, Frankie Higgs. 2024-05-27. Random coverage from within with variable radii, and Johnson-Mehl cover times. https://arxiv.org/abs/2405.17687

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