Related papers: Random Walks on Dicyclic Group
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
We investigate invariants for random elements of different hyperbolic groups. We provide a method, using Cayley graphs of groups, to compute the probability distribution of the minimal length of a random word, and explicitly compute the…
Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…
In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…
Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…
Random walk has wide applications in many fields, such as machine learning, biology, physics, and chemistry. Random walk can be discrete or continuous in time and space. Asymmetric random walk could be described by drift-diffusion equation.…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…
This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…
The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…
Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the…
We show the existence of a trace process at infinity for random walks on hyperbolic groups of conformal dimension < 2 and relate it to the existence of a reflecting random walk. To do so, we employ the theory of Dirichlet forms which…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
It is known that a properly rescaled version of Sinai's random walk converges in distribution to Brox's diffusion. In this article we quantify this convergence by considering a specific coupling between Sinai's walk and Brox's diffusion.…
A natural extension of a right-continuous integer-valued random walk is one which can jump to the right by one or two units. First passage times above a given fixed level then admit a tractable Laplace transform (probability generating…
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…
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings,…