Related papers: Large deviations for geodesic random walks
One of the most important properties of high dimensional expanders is that high dimensional random walks converge rapidly. This property has proven to be extremely useful in variety of fields in the theory of computer science from agreement…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
Continuing from the author's previous article 'Random walks and contracting elements I', we study random walks on (possibly asymmetric) metric spaces using the bounded geodesic image property (BGIP) of certain isometries. As an application,…
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk.…
We investigate a branching random walk where the displacements are independent from the branching mechanism and have a stretched exponential distribution. We describe the positions of the particles in the vicinity of the rightmost particle…
We show that, by sampling a sufficiently large number of random points in a neighborhood of a compact submanifold M of a Riemannian manifold N, one can recover the topology of M with high confidence. This holds under the assumptions on the…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…
The goal of these notes is to fill some gaps in the literature about random walks in the Cauchy domain of attraction, which has been in many cases left aside because of its additional technical difficulties. We prove here several results in…
We propose a new family of discrete-spacetime quantum walks capable to propagate on any arbitrary triangulations. Moreover we also extend and generalize the duality principle introduced by one of the authors, linking continuous local…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
The purpose of this paper is to ensure the conditions of G\"artner-Ellis Theorem for evaluations of the empirical measure. We show that up-to-date conditions for ensuring the convergence to a quasi-stationary distribution can be applied…
We investigate generalizations of the Cram\'er theorem. This theorem asserts that a Gaussian random variable can be decomposed into the sum of independent random variables if and only if they are Gaussian. We prove asymptotic counterparts…
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…