Related papers: Harmonic maps on amenable groups and a diffusive l…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…
The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…
In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…
In this paper we apply techniques of spherical harmonic analysis to prove a local limit theorem, a rate of escape theorem, and a central limit theorem for isotropic random walks on arbitrary thick regular affine buildings of irreducible…
In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…
We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…
We show that the generalized diffusion coefficient of a subdiffusive intermittent map is a fractal function of control parameters. A modified continuous time random walk theory yields its coarse functional form and correctly describes a…
This paper is concerned with random walks on a family of dyadic-valued solvable matrix groups. A description of the Poisson boundary of these groups for probability measures of finite first moment and non-zero displacements (or drifts) is…
We prove that random walks in random environments, that are exponentially mixing in space and time, are almost surely diffusive, in the sense that their scaling limit is given by the Wiener measure.
We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…
We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…
The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
We consider random walks in a random environment which are generalized versions of well-known effective models for Mott variable-range hopping. We study the homogenized diffusion constant of the random walk in the one-dimensional case. We…