Related papers: Walks on graphs and lattices -- effective bounds a…

Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…

We study time-inhomogeneous random walks on finite groups in the case where each random walk step need not be supported on a generating set of the group. When the supports of the random walk steps satisfy a natural condition involving…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

We consider a biased random walk $X_n$ on a Galton-Watson tree with leaves in the sub-ballistic regime. We prove that there exists an explicit constant $\gamma= \gamma(\beta) \in (0,1)$, depending on the bias $\beta$, such that $X_n$ is of…

Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…

It is proved that the Green's function of a symmetric finite range random walk on a co-compact Fuchsian group decays exponentially in distance at the radius of convergence R. It is also shown that Ancona's inequalities extend to R, and…

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$. We introduce the switched random walk determined by a finite set of probability distributions on…

Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph $C_n$,…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

In this article we study collisions of two independent random walks on comb graphs $\mathrm{Comb}(\tilde{G},f)$ for a large class of recurrent planar graphs $\tilde{G}$ and profile functions $f$, the latter governing the length of vertical…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

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,…

An infinite graph G has the property that a random walk in random environment on G defined by i.i.d. resistances with any common distribution is almost surely transient, if and only if for some p<1, simple random walk is transient on a…

For a finitely generated group G and a banach space X let \alpha^*_X(G) (respectively \alpha^#_X(G)) be the supremum over all \alpha\ge 0 such that there exists a Lipschitz mapping (respectively an equivariant mapping) f:G\to X and c>0 such…

We consider an inhomogeneous version of the Barak-Erd\H{o}s graph, i.e. a directed Er\H{o}s-R\'enyi random graph on $\{1,\ldots,n\}$ with no loop. Given $f$ a Riemann-integrable non-negative function on $[0,1]^2$ and $\gamma > 0$, we define…

In studying the end-to-end distribution function $G(r,N)$ of a worm like chain by using the propagator method we have established that the combinatorial problem of counting the paths contributing to $G(r,N)$ can be mapped onto the problem…