Related papers: Nine and ten lonely runners
We prove an almost sure invariance principle for a random walker among i.i.d. conductances in $\Z^d$, $d\geq 2$. We assume conductances are bounded from above but we dot require they are bounded from below.
We study variable-speed random walks on $\mathbb Z$ driven by a family of nearest-neighbor time-dependent random conductances $\{a_t(x,x+1)\colon x\in\mathbb Z, t\ge0\}$ whose law is assumed invariant and ergodic under space-time shifts. We…
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…
We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…
We consider the random walk among random conductances on Z^d. We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit…
A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…
For positive integers $\alpha$ and $\beta$, we define an $(\alpha,\beta)$-walk to be any sequence of positive integers satisfying $w_{k+2}=\alpha w_{k+1}+\beta w_k$. We say that an $(\alpha,\beta)$-walk is $n$-slow if $w_s=n$ with $s$ as…
We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
We show that for an i.i.d. bounded and weakly elliptic cookie environment, one dimensional excited random walk on the $k$-time leftover environment is right transient if and only if $\delta > k+1$ and has positive speed if and only if…
We study linearly edge-reinforced random walks on $\mathbb{Z}_+$, where each edge $\{x,x+1\}$ has the initial weight $x^{\alpha} \vee 1$, and each time an edge is traversed, its weight is increased by $\Delta$. It is known that the walk is…
We consider biased random walk among iid, uniformly elliptic conductances on $\mathbb{Z}^d$, and investigate the monotonicity of the velocity as a function of the bias. It is not hard to see that if the bias is large enough, the velocity is…
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
We consider the random conductance model in a stationary and ergodic environment. Under suitable moment conditions on the conductances and their inverse, we prove a quenched invariance principle for the random walk among the random…
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 random walk $(Z^{(1)}_n, ..., Z^{(K+1)}_n) \in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. In this paper, we show that this random walk is slowed down by a…
Let $G$ be a connected graph of uniformly bounded degree. A $k$ non-backtracking random walk ($k$-NBRW) $(X_n)_{n =0}^{\infty}$ on $G$ evolves according to the following rule: Given $ (X_n)_{n =0}^{s}$, at time $s+1$ the walk picks at…
We study the asymptotic behaviour of random walks in i.i.d. random environments on $\Z^d$. The environments need not be elliptic, so some steps may not be available to the random walker. We prove a monotonicity result for the velocity (when…
Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph $K_N$, which take turns, moving one at a time, is monotone in $N$. We use…
The continuous limit of one dimensional discrete-time quantum walks with time- and space-dependent coefficients is investigated. A given quantum walk does not generally admit a continuous limit but some families (1-jets) of quantum walks…