Random Walk, Local times, and subsets maximizing capacity - Probabilités et statistiques
Pré-Publication, Document De Travail Année : 2020

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.
Fichier principal
Vignette du fichier
cap-3.pdf (274.97 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02499113 , version 1 (05-03-2020)
hal-02499113 , version 2 (14-12-2021)

Identifiants

Citer

Amine Asselah, Bruno Schapira. Random Walk, Local times, and subsets maximizing capacity. 2020. ⟨hal-02499113v1⟩

Collections

LAMA_PS
104 Consultations
71 Téléchargements

Altmetric

Partager

More