Related papers: Renewal structure of the Tree Builder Random Walk

Let $\rho$ be a borelian probability measure on $\mathrm{SL}_d(\mathbb{R})$. Consider the random walk $(X_n)$ on $\mathbb{R}^d\setminus\{0\}$ defined by $\rho$ : for any $x\in \mathbb{R}^d\setminus\{0\}$, we set $X_0 =x$ and $X_{n+1} =…

This paper takes the so-called probabilistic approach to the Strong Renewal Theorem (SRT) for multivariate distributions in the domain of attraction of a stable law. A version of the SRT is obtained that allows any kind of…

Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…

. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…

Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding random walk one gets after erasing the loops from a simple random walk in order or alternatively by considering the…

In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the…

This work is motivated by the study of some two-dimensional random walks in random environment (RWRE) with transition probabilities independent of one coordinate of the walk. These are non-reversible models and can not be treated by…

This paper deals with a transient random walk in Dirichlet environment, or equivalently a linearly edge reinforced random walk, on a Galton-Watson tree. We compute the stationary distribution of the environment seen from the particle of an…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…

The paper is devoted to an invariance principle for Kemperman's model of oscillating random walk on $\mathbb{Z}$. This result appears as an extension of the invariance principal theorem for classical random walks on $\mathbb{Z}$ or…

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Given a probability measure $\mu$ on a finitely generated group $\Gamma$, the Green function $G(x,y|r)$ encodes many properties of the random walk associated with $\mu$. Finding asymptotics of $G(x,y|r)$ as $y$ goes to infinity is a common…

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for…

This paper studies a class of growing systems of random walks on regular trees, known as \emph{frog models with geometric lifetime} in the literature. With the help of results from renewal theory, we derive new bounds for their critical…

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…

We consider loop-erased random walk (LERW) running between two boundary points of a square grid approximation of a planar simply connected domain. The LERW Green's function is the probability that the LERW passes through a given edge in the…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the…