Related papers: Scaling limit of the loop-erased random walk Green…

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

In the first part of the article our subject of interest is a simple symmetric random walk on the integers which faces a random risk to be killed. This risk is described by random potentials, which in turn are defined by a sequence of…

Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…

We introduce partial loop-erasing operators. We show that by applying a refinement sequence of partial loop-erasing operators to a finite Markov chain, we get a process equivalent to the chronological loop-erased Markov chain. As an…

It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…

Attributing a positive value \tau_x to each x in Z^d, we investigate a nearest-neighbour random walk which is reversible for the measure with weights (\tau_x), often known as "Bouchaud's trap model". We assume that these weights are…

We consider the limit behavior of an excited random walk (ERW), i.e., a random walk whose transition probabilities depend on the number of times the walk has visited to the current state. We prove that an ERW being naturally scaled…

In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…

Many stochastic time series can be modelled by discrete random walks in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$. In correlated discrete time random walks (CDTRWs), the…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of…

Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…

We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

Reinforced random walks are random walks on graphs whose transition probabilities along edges from a vertex are proportional to the weights of those edges, but where the weight of an edge evolves in a way that depends on the past traversals…

We describe scaling limits of recurrent excited random walks (ERWs) on integers in i.i.d. cookie environments with a bounded number of cookies per site. We allow both positive and negative excitations. It is known that ERW is recurrent if…

We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in…

We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…