Searcharxiv⌕ Search

arXiv · math/0604293

Moderate deviations for random walk in random scenery

Abstract

We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering all those regimes where rate and speed do not depend on the actual distribution of the scenery. In the case of dimension four and larger we even obtain precise asymptotics for the annealed probability of a moderate deviation, extending a classical central limit theorem of Kesten and Spitzer. In dimension three and larger, an important ingredient in the proofs are new concentration inequalities for self-intersection local times of random walks, which are of independent interest, whilst in dimension two we use a recent moderate deviation result for self-intersection local times, which is due to Bass, Chen and Rosen.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Klaus Fleischmann, Peter Morters, Vitali Wachtel. 2006-10-11. Moderate deviations for random walk in random scenery. https://arxiv.org/abs/math/0604293

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

KEEP EXPLORING

Related papers

On the minimum bisection of random $3$-regular graphs

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

math.PR↗

Quantitative Propagation of Chaos for Singular Interacting Particle Systems Driven by Fractional Brownian Motion

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean--Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

math.PR↗

Power rate of convergence of discrete curves: framework and applications

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

math.PR↗