In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile $\{f(n), n\in \ZZ\}$. One interesting result is that if $f(n)$ has a growth order as $n\log n$, then two independent simple random walks on the wedge comb will collide infinitely many times. Another is that if $\{f(n); n\in \ZZ\}$ are given by i.i.d. non-negative random variables with finite mean, then for almost all wedge comb with such profile, three independent simple random walks on it will collide infinitely many times.
In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.
We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{β^+}$ and $x_2 = -a^- x_1^{β^-}$, with $x_1 \geq 0$. In the interior of the domain, the random walk has zero drift and a given increment covariance matrix. From the vicinity of the upper and lower sections of the boundary, the walk drifts back into the interior at a given angle $α^+$ or $α^-$ to the relevant inwards-pointing normal vector. Here we focus on the case where $α^+$ and $α^-$ are equal but opposite, which includes the case of normal reflection. Fo…
We study quantitative asymptotics of planar random walks that are spatially non-homogeneous but whose mean drifts have some regularity. Specifically, we study the first exit time $τ_α$ from a wedge with apex at the origin and interior half-angle $α$ by a non-homogeneous random walk on the square lattice with mean drift at $x$ of magnitude $O(1/|x|)$ as $|x| \to \infty$. This is the critical regime for the asymptotic behaviour: under mild conditions, a previous result of the authors (see arXiv:0910.1772) stated that $τ_α< \infty$ a.s. for any $α$ (while for a stronger drift field $τ_α$ is infin…
We study the enhanced diffusivity in the so called elephant random walk model with stops (ERWS) by including symmetric random walk steps at small probability $ε$. At any $ε> 0$, the large time behavior transitions from sub-diffusive at $ε= 0$ to diffusive in a wedge shaped parameter regime where the diffusivity is strictly above that in the un-perturbed ERWS model in the $ε\downarrow 0$ limit. The perturbed ERWS model is shown to be solvable with the first two moments and their asymptotics calculated exactly in both one and two space dimensions. The model provides a discrete analytical setting…
We consider random walks in i.i.d. elliptic random environments which are not uniformly elliptic. We introduce a computable condition in dimension $d=2$ and a general condition valid for dimensions $d\ge 2$ expressed in terms of the exit time from a box, which ensure that local trapping would not inhibit a ballistic behavior of the random walk. An important technical innovation related to our computable condition, is the introduction of a geometrical point of view to classify the way in which the random walk can become trapped, either in an edge, a wedge or a square. Furthermore, we prove that…
We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a finite variance $σ^2$. We derive the asymptotic form of $p_A^n(x, y)$ for large $n$ valid uniformly in the regime characterized by the conditions $|x|\vee |y| =O(\sqrt n)$ and $|x|\wedge |y|= o(\sqrt n)$, in which $p^A_t({\bf x},{\bf y})$ behaves for large $n$ like $[g_A^{+}(x)\hat g_{A}^{\,+}(y) + g_A^-(x)\hat g_{A}^{\,-}(y)] (σ^{2}/2n) p^n(y-x)$. Here $p^n(y-x)…
We obtain upper bounds for the rates of convergence for the simple random walk Green's function in the domains $D_α= D_α(n)=\{re^{iθ}\in \mathbb{C}:0 <θ<2π-α, 0<r<2n\}-z_0,$ where $z_0\in\mathbb{Z}^2$ is a point closest to $ne^{i(π-α/2)}$. The rate depends on the angle of the wedge and is what was suggested by the sharpest available results in the extreme cases $α=0$ and $α=π$. Our proof uses the KMT coupling between random walk and Brownian motion.
Exact coupling of random walks is studied. Conditions for admitting a successful exact coupling are given that are necessary and in the Abelian case also sufficient. In the Abelian case, it is shown that a random walk $S$ with step-length distribution $μ$ started at $0$ admits a successful exact coupling with a version $S^x$ started at $x$ if and only if there is $n\geq 1$ with $μ^{n} \wedge μ^{n}(x+\cdot) \neq 0$. Moreover, when a successful exact coupling exists, the total variation distance between $S_n$ and $S^x_n$ is determined to be $O(n^{-1/2})$ if $x$ has infinite order, or $O(ρ^n)$ fo…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.
The Half-Plane Half-Comb walk is a random walk on the plane, when we have a square lattice on the upper half-plane and a comb structure on the lower half-plane, i.e. horizontal lines below the x-axis are removed. We prove that the probability that this walk returns to the origin in 2N steps is asymptotically equal to 2/(πN). As15 pag a consequence we prove strong laws and a limit distribution for the local time.
We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-α}$ with $α>0$. For random walk in any dimension $d$ and for self-avoiding walk and critical/subcritical oriented percolation above the common upper-critical dimension $d_{\mathrm{c}}\equiv2(α\wedge2)$, we prove large-$t$ asymptotics of the gyration radius, which is the average end-to-end distance of random walk/self-avoiding walk of length $t$ or the average spatial size of an oriente…
We study the path behavior of the simple symmetric walk on some comb-type subsets of Z^2 which are obtained from Z^2 by removing all horizontal edges belonging to certain sets of values on the y-axis. We obtain some strong approximation results and discuss their consequences.
We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting random walk couplings, these allow us to reprove some known transience and recurrence results for some simple models. We also obtain new results for one-dimensional multi-excited random walks and for random walks in random environments in all dimensions.
The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of v, each with probability 1/d(v), where d(v) denotes the degree of v. We answer a question of Csáki, Csörgö, Földes, Révész, and Tusnády by showing that the expected number of vertices visited by a random walk on the comb after n steps is (1/(2\sqrt{2π})+o(1))\sqrt n\log n. This contradicts a claim of Weiss and Havlin.
We study the path behaviour of a simple random walk on the 2-dimensional comb lattice ${\mathbb C}^2$ that is obtained from ${\mathbb Z}^2$ by removing all horizontal edges off the x-axis. In particular, we prove a strong approximation result for such a random walk which, in turn, enables us to establish strong limit theorems, like the joint Strassen type law of the iterated logarithm of its two components, as well as their marginal Hirsch type behaviour.
Let $ξ(k,n)$ be the local time of a simple symmetric random walk on the line. We give a strong approximation of the centered local time process $ξ(k,n)-ξ(0,n)$ in terms of a Wiener sheet and an independent Wiener process, time changed by an independent Brownian local time. Some related results and consequences are also established.
In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the rate of decay of the percolation process, we show that the return probability decays like $t^{-\ffrac{d}{s-d}}$ up to logarithmic corrections, where $t$ denotes the time the walk is run. Moreover, our methods also yield generalized bounds on the spectral gap of the dynamics and on the diameter of the largest component in a box. Besides its intrinsic interest,…
We consider the invariant measure of homogeneous random walks in the quarter-plane. In particular, we consider measures that can be expressed as a finite linear combination of geometric terms and present conditions on the structure of these linear combinations such that the resulting measure may yield an invariant measure of a random walk. We demonstrate that each geometric term must individually satisfy the balance equations in the interior of the state space and further show that the geometric terms in an invariant measure must have a pairwise-coupled structure. Finally, we show that at leas…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.
Parrondo's paradox is extended to regime switching random walks in random environments. The paradoxical behavior of the resulting random walk is explained by the effect of the random environment. Full characterization of the asymptotic behavior is achieved in terms of the dimensions of some random subspaces occurring in Oseledec's theorem. The regime switching mechanism gives our models a richer and more complex asymptotic behavior than the simple random walks in random environments appearing in the literature, in terms of transience and recurrence.
We analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the distance from the origin, the maximal deviation and the maximal span in $n$ steps, proving that for all these quantities the order is $n^{1/4}$ for the horizontal projection and $n^{1/2}$ for the vertical one (the exact constants are determined). Then we rescale the two projections of the random walk dividing by $n^{1/4}$ and $n^{1/2}$ the horizontal and vertical…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first coordinate is proved and the limit variance is explicited. In this paper, we study an extended version of this model by conditioning the extremal coordinates to be at some fixed distance at every time. We prove a functional central limit theorem for this random walk. Using combinatorial tools, we give a precise formula of the variance and compare it with the on…
We give a local central limit theorem for simple random walks on Z^d, including Gaussian error estimates. The detailed proof combines standard large deviation techniques with Cramer-Edgeworth expansions for lattice distributions.
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various conditions under which the relaxation time decreases with the introduction of jumps.
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted paths of $n$ steps allows an easier combinatorial enumeration of the paths. It also seems promising for the theory of tridiagonal random matrices .
