Related papers: Random walks in Dirichlet environment: an overview
We prove that every random walk in i.i.d. environment in dimension greater than or equal to 2 that has an almost sure positive speed in a certain direction, an annealed invariance principle and some mild integrability condition for…
We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…
In this paper we study the property of asymptotic direction for random walks in random i.i.d. environments (RWRE). We prove that if the set of directions where the walk is transient is non empty and open, the walk admits an asymptotic…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…
The scaling properties of a random walker subject to the global constraint that it needs to visit each site an even number of times are determined. Such walks are realized in the equilibrium state of one dimensional surfaces that are…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
The edge-reinforced random walk (ERRW) is a random process on the vertices of a graph that is more likely to cross the edges it has visited in the past. Depending on the strength of the reinforcement, the ERRW of a single particle can…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…
We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…
In this paper, we study random walks evolving on Z in a dynamic random environment that we assume to have time correlations that decrease polynomially fast. We show a law of large numbers by generalizing methods already used for the…
We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…
Random walks in random environments (RWRE's) have been a source of surprising phenomena and challenging problems since they began to be studied in the 70's. Hitting times and, more recently, certain regeneration structures, have played a…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…
Let $(Z_n)_{n\in\N}$ be a $d$-dimensional {\it random walk in random scenery}, i.e., $Z_n=\sum_{k=0}^{n-1}Y(S_k)$ with $(S_k)_{k\in\N_0}$ a random walk in $\Z^d$ and $(Y(z))_{z\in\Z^d}$ an i.i.d. scenery, independent of the walk. The…