Related papers: Random Walks on Dicyclic Group
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 a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
In this article we define and study a stochastic process on Galoisian covers of compact manifolds. The successive positions of the process are defined recursively by picking a point uniformly in the Dirichlet domain of the previous one. We…
We show that for each $\lambda \in [\frac{1}{2}, 1]$, there exists a solvable group and a finitely supported measure such that the associated random walk has upper speed exponent $\lambda$.
We study the path behavior of the simple symmetric walk on some comb-type subsets of Z^2 which are obtained from Z^2 by removing all horizontal edges belonging to certain sets of values on the y-axis. We obtain some strong approximation…
A popular account of the connection between random walks and electric networks.
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
We study the topological dynamics of the action of an acylindrically hyperbolic group on the space of its infinite index convex cocompact subgroups by conjugation. We show that, for any suitable probability measure $\mu$, random walks with…
We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
The entropy of the random walk on the discrete contable group could be used for comparison of the system of the generators. Fundamental inequality between growth, entropy and escape gives the possibility to define "the best" system of the…
We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.
In this note we prove a large deviation result for the intersection of the ranges of two independent random walks in dimension two. This complements the study of Phetpradap from 2011, where the intersection in dimension three and above was…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…
We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which…