Related papers: Dual graphs and modified Barlow--Bass resistance e…
We investigate the relation between simple random walks on repeated barycentric subdivisions of a triangle and a self-similar fractal, Strichartz hexacarpet, which we introduce. We explore a graph approximation to the hexacarpet in order to…
We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…
We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…
Self-repelling two-leg (biped) spider walk is considered where the local stochastic movements are governed by two independent control parameters $ \beta_d$ and $ \beta_h $, so that the former controls the distance ($ d $) between the legs…
We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that the simple random walk is recurrent, and that the resistance…
We prove expectation and concentration results for the following random variables on an Erd\H{o}s-R\'enyi random graph $\mathcal{G}\left(n,p\right)$ in the sparsely connected regime $\log n + \log\log \log n \leq np < n^{1/10}$: effective…
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…
It has recently been shown that networks possessing scale-free and fractal properties may exhibit a bifractal nature, in which local structures are described by two different fractal dimensions. In this study, we investigate random walks on…
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \varrho^{-n} (1+o(1))$, where…
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…
This paper considers non-backtracking random walks on random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph…
We show that the electrical resistance between the origin and generation n of the incipient infinite oriented branching random walk in dimensions d<6 is O(n^{1-alpha}) for some universal constant alpha>0. This answers a question of Barlow,…
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…
In this paper, we find a natural four dimensional analog of the moderate deviation results for the capacity of the random walk, which corresponds to Bass, Chen and Rosen \cite{BCR} concerning the volume of the random walk range for $d=2$.…
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…
We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…