Related papers: Sums of twisted circulants

Our previous work presented explicit formulas for the generalized zeta function and the generalized Ihara zeta function corresponding to the Grover walk and the positive-support version of the Grover walk on the regular graph via the…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we…

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

In this article, we consider products of random walks on finite groups with moderate growth and discuss their cutoffs in the total variation. Based on several comparison techniques, we are able to identify the total variation cutoff of…

Let $G$ be a finitely generated group equipped with a finite symmetric generating set and the associated word length function $|\cdot |$. We study the behavior of the probability of return for random walks driven by symmetric measures $\mu$…

A matrix random walk is a stochastic process of the form $B_k = (I+A_1)\cdots(I+A_k)$ where $A_j$ are independent ``step'' matrices in $\mathrm{M}_N(\mathbb{C})$. With the right entry-covariance, a rescaled matrix random walk converges to…

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for…

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

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…

We prove a central limit theorem for linear triangular arrays under weak dependence conditions. Our result is then applied to the study of dependent random variables sampled by a $\bbZ$-valued transient random walk. This extends the results…

In this work we study a generalization of the standard random walk, an homotopic random walk (HRW), using a deformed translation unitary step that arises from a homotopy of the position-dependent masses associated to the Tsallis and…

Let $S(n)$ be a centered random walk with finite second moment. We consider the integrated random walk $T(n) = S(0)+S(1)+\dots+S(n)$. We prove invariance principles for the meander and for the bridge of this process, under the condition…

We consider random walks on the support of a random purely atomic measure on $\mathbb{R}^d$ with random jump probability rates. The jump range can be unbounded. The purely atomic measure is reversible for the random walk and stationary for…

We present a new method to compute the first crossing distribution in excursion set theory for the case of correlated random walks. We use a combination of the path integral formalism of Maggiore & Riotto, and the integral equation solution…

Let $\mm_n, n=0,1,...$ be the supercritical branching random walk, in which the number of direct descendants of one individual may be infinite with positive probability. Assume that the standard martingale $W_n$ related to $\mm_n$ is…

Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the…

Wildberger's construction enables us to obtain a hypergroup from a special graph via random walks. We will give a probability theoretic interpretation to products on the hypergroup. The hypergroup can be identified with a commutative…