SearcharxivSearch

arXiv · 2511.08817

Covering of an inner subset by the confined random walk

Abstract

We consider the simple random walk conditioned to stay forever in a finite domain $D_N \subset \mathbb{Z}^d, d \geq 3$ of typical size $N$. This confined walk is a random walk on the conductances given by the first eigenvector of the Laplacian on $D_N$. On inner sets of $D_N$, the trace of this confined walk can be approximated by tilted random interlacements, which is a useful tool to understand some properties of the walk. In this paper, we propose to study the cover time of inner subsets $\Lambda_N$ of $D_N$ as well as the so-called late points of these subsets. If $\Lambda_N$ contains enough late points, we obtain the asymptotic expansion of the covering time as $c_\Lambda N^d \big[ \log N - \log\log N + \mathcal{G} \big]$, with $\mathcal{G}$ a Gumbel random variable, as well as a Poisson repartition of these late points. The method we use is similar to Belius' work about the simple random walk on the torus, which displays the same asymptotics albeit without the $\log \log N$ term. In the more general setting of ``ball-like'' $\Lambda_N$, we simply get the first term of the asymptotic expansion.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolas Bouchot. 2025-11-11. Covering of an inner subset by the confined random walk. https://arxiv.org/abs/2511.08817

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