相关论文: Random walks on the torus with several generators

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

We obtain the leading orders of the maximum and the minimum of local times for the simple random walk on the two-dimensional torus at time proportional to the cover time. We also estimate the number of points with large (or small) values of…

We study hitting times in simple random walks on graphs, which measure the time required to reach specific target vertices. Our main result establishes a sharp lower bound for the variance of hitting times. For a simple random walk on a…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

The rate of convergence of simple random walk on the Heisenberg group over $Z/nZ$ with a standard generating set was determined by Bump et al [1,2]. We extend this result to random walks on the same groups with an arbitrary minimal…

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 consider non-backtracking random walk (NBW) in the nearest-neighbor setting on the Zd-lattice and on tori. We evaluate the eigensystem of the m X m-dimensional transition matrix of NBW where m denote the degree of the graph. We use its…

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…

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…

We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…

A correlated random walk approach to diffusion is applied to the disordered nonoverlapping Lorentz gas. By invoking the Lu-Torquato theory for chord-length distributions in random media [J. Chem. Phys. 98, 6472 (1993)], an analytic…

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially…

The main result of this paper is a decomposition theorem for a measure on the one-dimensional torus. Given a sufficiently large subset $S$ of the positive integers, an arbitrary measure on the torus is decomposed as the sum of two measures.…

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

Attributing a positive value \tau_x to each x in Z^d, we investigate a nearest-neighbour random walk which is reversible for the measure with weights (\tau_x), often known as "Bouchaud's trap model". We assume that these weights are…

This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…

We study the capacity of the range of a transient simple random walk on $\mathbb{Z}^d$. Our main result is a central limit theorem for the capacity of the range for $d\ge 6$. We present a few open questions in lower dimensions.

We introduce a method to exactly generate bridge trajectories for discrete-time random walks, with arbitrary jump distributions, that are constrained to initially start at the origin and return to the origin after a fixed time. The method…