Extracting subsets maximizing capacity and folding of random walks
From MaRDI portal
Publication:6131446
DOI10.24033/ASENS.2561arXiv2003.03073OpenAlexW3009558310MaRDI QIDQ6131446FDOQ6131446
Authors: Amine Asselah, Bruno Schapira
Publication date: 5 April 2024
Published in: Annales Scientifiques de l?tcole Normale Sup�rieure (Search for Journal in Brave)
Abstract: We prove that in any finite set of with , there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {it covering uniformly} a finite set, and characterize some {it folding} events, under optimal hypotheses. For instance, knowing that a region of space has an {it atypically high occupation density} by some random walk, we show that this random region is most likely ball-like
Full work available at URL: https://arxiv.org/abs/2003.03073
Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50)
Cites Work
- Asymptotic evaluation of certain markov process expectations for large time, I
- Random walk: A modern introduction
- Topics in occupation times and Gaussian free fields
- Vacant set of random interlacements and percolation
- Two-dimensional Brownian motion and harmonic functions
- Moderate deviations for the volume of the Wiener sausage
- Large deviations for occupation time profiles of random interlacements
- Disconnection, random walks, and random interlacements
- Disconnection and level-set percolation for the Gaussian free field
- Potentials and the random walk
- Solidification of porous interfaces and disconnection
- Large Deviations for Intersections of Random Walks
- The two regimes of moderate deviations for the range of a transient walk
- Moderate deviations for the range of a transient random walk: path concentration
- Scaling limits and fluctuations for random growth under capacity rescaling
- Excess deviations for points disconnected by random interlacements
- On the cost of the bubble set for random interlacements
This page was built for publication: Extracting subsets maximizing capacity and folding of random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131446)