Related papers: Infinite collision property for the three-dimensio…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
We study the probability that a random walk started inside a subgraph of a larger graph exits that subgraph (or, equivalently, hits the exterior boundary of the subgraph). Considering the chance a random walk started in the subgraph never…
We consider a one-dimensional system of particles, moving at constant velocities chosen independently according to a symmetric distribution on $\{-1,0,+1\}$, and annihilating upon collision -- with, in case of triple collision, a uniformly…
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…
Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part of which relies on a criterion proposed by Fontes, Isopi,…
We consider non-homogeneous random walks on the two-dimensional positive quadrant $\mathbb{N}^2$ and the one-dimensional slab $\{0,1,\dots,k\}\times\mathbb{N}$. In the 1960's the following question was asked for $\mathbb{N}^2$: is it true…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
For a simple symmetric random walk in dimension $d\geq 3$, a uniform strong law of large numbers is proved for the number of sites with given local time up to time $n$.
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…