Related papers: Divisible sandpiles via random walks in random sce…

We consider a random walk on a closed manifold $M$ driven by a probability measure $\mu$ on the space of $C^2$ diffeomorphisms. Provided $\mu$ has compact support, satisfies certain gap and pinching conditions, and is weak-$*$ close to a…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We provide an explicit formula for the global mean first-passage time (GMFPT) for random walks in a general graph with a perfect trap fixed at an arbitrary node, where GMFPT is the average of mean first-passage time to the trap over all…

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

Strong ratio limit theorems associated with a broad class of spread out random walks on unimodular groups were proved in the preceding paper, where these random walks were assumed to have the convergence parameter $R=1$. In the present…

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…

The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on $\Z^d$, $d \geq…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…

We study how far a diffusion process on a graph can deviate from a designed starting pattern when the pattern is generated via Laplacian regularisation. Under standard stability conditions for undirected, entrywise nonnegative graphs, we…

A common model of robustness of a graph against random failures has all vertices operational, but the edges independently operational with probability $p$. One can ask for the probability that all vertices can communicate ({\em all-terminal…

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Let $r: S\times S\to \bb R_+$ be the jump rates of an irreducible random walk on a finite set $S$, reversible with respect to some probability measure $m$. For $\alpha >1$, let $g: \bb N\to \bb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k) =…

Consider the uniform random graph $G(n,M)$ with $n$ vertices and $M$ edges. Erd\H{o}s and R\'enyi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} $$ exists and is a constant strictly…

In [MaII] Mather proved that a smooth proper infinitesimally stable map is stable. This result is the key component of the Mather stability theorem [MaV], which can be reformulated as follows: a smooth proper map $f: M\to N$ is stable if…

We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We…

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…

Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…

Motivated by multiphase flow in reservoirs, we propose and study a two-species sandpile model in two dimensions. A pile of particles becomes unstable and topples if, at least one of the following two conditions is fulfilled: 1) the number…

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…