On Polya-Friedman random walks
Texte intégral
Documents relatifs
We also study the range of random walks in random scenery, from which the asymptotic behaviour of the range of the first coordinate of the Campanino and P´etritis random walk can
Large deviation principle for one- dimensional random walk in dynamic random environment: Attractive spin-flips and simple symmetric exclusion. Law of large numbers for a class
Récemment, Enriquez, Sabot et Zindy (cf. [17]) ont donné une nouvelle preuve de ce théorème dans le cas où 0 < κ < 1 par une tout autre méthode, basée sur l’étude fine
Consider the first passage Green function of walks which always remain within a given triangle at level.. Level 1 corresponds to the smallest
We prove a quantitative equidistribution result for linear random walks on the torus, similar to a theorem of Bourgain, Furman, Lindenstrauss and Mozes, but without any
In the eighties, Lawler established estimates on intersection probabilities for random walks, which are relevant tools for estimating the expected capacity of the range (see
A fragmentation occurs in the random permutation when a transposition occurs between two integers in the same σ-cycle, so tree components in the random graph correspond to cycles in
To complete the proof of Theorem 5.1, we first observe that the genealogy of particles close to the minimal displacement at time n in the branching random walk are either