Random Walk, Local times, and subsets maximizing capacity
Résumé
We prove that in any finite set, in Z d with d ≥ 3, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. This implies some optimal estimates on probabilities of various folding events of a random walk. For instance, knowing that a random walk folds into an atypical high density region, we show that this random region is most likely ball-like.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...