Related papers: Semiconservative random walks in weak sense
We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length alpha n^2. Must the set of edges traversed by W form a quasirandom graph? This question was asked by B\"ottcher, Hladk\'y, Piguet and Taraz. Our aim in…
. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…
We study the quenched behaviour of a perturbed version of the simple symmetric random walk on the set of integers. The random walker moves symmetrically with an exception of some randomly chosen sites where we impose a random drift. We show…
Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…
In the present paper we find necessary and sufficient conditions for recurrence of random walks on arbitrary subgroups of the group of rational numbers $\mathbb{Q}$.
A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
We consider a random walk in $\mathbb Z^d$ which jumps from a site $x$ to a nearest neighboring site $x+e$ (where $e\in V:=\{x\in\mathbb Z^d: |x|_1=1\}$) with probability $p_0(e)+\epsilon\xi(x,e)$. Here $\sum_e p_0(e)=1$, $p_0(e)> 0$,…
This paper studies a family of random walks defined on the finite ordinals using their order reversing involutions. Starting at $x \in \{0,1,\ldots,n-1\}$, an element $y \le x$ is chosen according to a prescribed probability distribution,…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling, coined repelling random walks. By inducing correlations between the trajectories of an interacting ensemble such that their marginal transition probabilities…
In this paper we show how polynomial walks can be used to establish a twisted recurrence for sets of positive density in $\mathbb{Z}^d$. In particular, we prove that if $\Gamma \leq \operatorname{GL}_d(\mathbb{Z})$ is finitely generated by…
In this paper we establish Functional Limit Theorems for the range of random walks in $\mathbb{Z}^d$ that are in the domain of attraction of a non-degenerate $\beta$-stable process in the weakly transient and recurrent regimes. These…
We describe a new construction of a family of measures on a group with the same Poisson boundary. Our approach is based on applying Markov stopping times to an extension of the original random walk.
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…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…
We establish a relationship between the Small-World behavior found in complex networks and a family of Random Walks trajectories using, as a linking bridge, a maze iconography. Simple methods to generate mazes using Random Walks are…