SearcharxivSearch

arXiv · 2309.02822

Uniqueness and tube property for the Swiss cheese large deviations

Abstract

We consider the simple random walk on the Euclidean lattice, in three dimensions and higher, conditioned to visit fewer sites than expected, when the deviation from the mean scales like the mean. The associated large deviation principle was first derived in 2001 by van den Berg, Bolthausen and den Hollander in the continuous setting, that is for the volume of a Wiener sausage, and later taken up by Phetpradap in the discrete setting. One of the key ideas in their work is to condition the range of the random walk to a certain skeleton, that is a sub-sequence of the random walk path taken along an appropriate mesoscopic scale. In this paper we prove that (i) the rate function obtained by van den Berg, Bolthausen and den Hollander has a unique minimizer over the set of probability measures modulo shifts, at least for deviations of the range well below the mean, and (ii) the empirical measure of the skeleton converges under the conditioned law, in a certain manner, to this minimizer. To this end we use an adaptation of the topology recently introduced by Mukherjee and Varadhan to compactify the space of probability measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Julien Poisat, Dirk Erhard. 2023-09-06. Uniqueness and tube property for the Swiss cheese large deviations. https://arxiv.org/abs/2309.02822

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