In 2008, T\'oth and Vet\H{o} defined the self-repelling random walk with directed edges as a non-Markovian random walk on $\mathbb{Z}$: in this model, the probability that the walk moves from a point of $\mathbb{Z}$ to a given neighbor depends on the number of previous crossings of the directed edge from the initial point to the target, called the local time of the edge. They found this model had a very peculiar behavior. Indeed, for the non-Markovian random walks most closely related to it, which are defined with undirected edges replacing directed edges, T\'oth proved in his works of 1994, 1995 and 1996 that the process formed by the local times of all the edges, evaluated at a stopping time of a certain type and suitably renormalized, co...
This paper considers non-backtracking random walks on random graphs generated according to the confi...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersec...
We study the asymptotic behaviour of a d-dimensional self-interacting random walk (Xn)n∈ℕ (ℕ:={1,2,3...
We consider a biased random walk in positive random conductances on $\mathbb{Z}^d$ for $d\geq 5$. In...
We consider Sinai's random walk in random environment $(S_n)_{n\in\mathbb{N}}$. We prove a local lim...
AbstractWe consider a transient random walk on Z in random environment, and study the almost sure as...
We study asymptotic laws of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible envi...
We consider biased random walks on random networks constituted by a random comb comprising a backbon...
Abstract. We present a brief survey of results concerning self-interacting ran-dom walks and self-re...
The evolution of many stochastic systems is accurately described by random walks on graphs. We here ...
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for la...
We consider transient random walks in random environment on Z in the positive speed (ballistic) and ...
Suppose that $(X,Y,Z)$ is a random walk in $\Z^3$ that moves in the following way: on the first visi...
International audienceWe consider transient random walks in random environment on $\z$ with zero asy...
This paper considers non-backtracking random walks on random graphs generated according to the confi...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersec...
We study the asymptotic behaviour of a d-dimensional self-interacting random walk (Xn)n∈ℕ (ℕ:={1,2,3...
We consider a biased random walk in positive random conductances on $\mathbb{Z}^d$ for $d\geq 5$. In...
We consider Sinai's random walk in random environment $(S_n)_{n\in\mathbb{N}}$. We prove a local lim...
AbstractWe consider a transient random walk on Z in random environment, and study the almost sure as...
We study asymptotic laws of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible envi...
We consider biased random walks on random networks constituted by a random comb comprising a backbon...
Abstract. We present a brief survey of results concerning self-interacting ran-dom walks and self-re...
The evolution of many stochastic systems is accurately described by random walks on graphs. We here ...
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for la...
We consider transient random walks in random environment on Z in the positive speed (ballistic) and ...
Suppose that $(X,Y,Z)$ is a random walk in $\Z^3$ that moves in the following way: on the first visi...
International audienceWe consider transient random walks in random environment on $\z$ with zero asy...
This paper considers non-backtracking random walks on random graphs generated according to the confi...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Weakly self-avoiding walk (WSAW) is a model of simple random walk paths that penalizes self-intersec...