相关论文: Excited Random Walk

Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

We study the capacity of the range of a transient simple random walk on $\mathbb{Z}^d$. Our main result is a central limit theorem for the capacity of the range for $d\ge 6$. We present a few open questions in lower dimensions.

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

A Random Walk in Changing Environment (RWCE) is a weighted random walk on a locally finite, connected graph $G$ with random, time-dependent edge-weights. This includes self-interacting random walks, where the edge-weights depend on the…

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…

We study the asymptotics of the probabilities of extreme slowdown events for transient one-dimensional excited random walks. That is, if $\{X_n\}_{n\geq 0}$ is a transient one-dimensional excited random walk and $T_n = \min\{ k: \, X_k =…

We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…

We consider a random walk with transition probabilities weakly dependent on an environment with a deterministic, but strongly chaotic, evolution. We prove that for almost all initial conditions of the environment the walk satisfies the CLT.

We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…

We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit…

We consider an i.i.d. random environment with a strong form of transience on the two dimensional integer lattice. Namely, the walk always moves forward in the y-direction. We prove a functional CLT for the quenched expected position of the…

We study rotor walks on transient graphs with initial rotor configuration sampled from the oriented wired uniform spanning forest (OWUSF) measure. We show that the expected number of visits to any vertex by the rotor walk is at most equal…

Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has visited every vertex. We call such a random walk a random…

Mott variable range hopping is a fundamental mechanism for low-temperature electron conduction in disordered solids in the regime of Anderson localization. In a mean field approximation, it reduces to a random walk (shortly, Mott random…

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…

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…