English
Related papers

Related papers: Angular asymptotics for multi-dimensional non-homo…

200 papers

Open quantum walks often lead to a classical asymptotic behavior. Here, we look for a simple open quantum walk whose asymptotic behavior can be non-classical. We consider a discrete-time quantum walk on n-cycle subject to a random…

Quantum Physics · Physics 2019-11-27 Adam S. Sajna , Tomasz P. Polak , Antoni Wojcik , Pawel Kurzynski

We consider a random walk $S_{\tau}$ which is obtained from the simple random walk $S$ by a discrete time version of Bochner's subordination. We prove that under certain conditions on the subordinator $\tau$ appropriately scaled random walk…

Probability · Mathematics 2017-02-22 Alexander Bendikov , Wojciech Cygan , Bartosz Trojan

We study the set of directions asymptotically explored by a spatially homogeneous random walk in $d$-dimensional Euclidean space. We survey some pertinent results of Kesten and Erickson, make some further observations, and present some…

Probability · Mathematics 2022-01-06 Alejandro López Hernández , Andrew R. Wade

We show that the asymptotic entropy of a random walk on a nonelementary hyperbolic group, with symmetric and bounded increments, is differentiable and we identify its derivative as a correlation. We also prove similar results for the rate…

Probability · Mathematics 2015-01-12 P. Mathieu

The goal of this article is two-fold: in a first part, we prove Azuma-Hoeffding type concentration inequalities around the drift for the displacement of non-elementary random walks on hyperbolic spaces. For a proper hyperbolic space $M$, we…

Probability · Mathematics 2022-02-07 Richard Aoun , Cagri Sert

Consider a Markov chain $(X_n)_{n\geqslant 0}$ with values in the state space $\mathbb X$. Let $f$ be a real function on $\mathbb X$ and set $S_0=0,$ $S_n = f(X_1)+\cdots + f(X_n),$ $n\geqslant 1$. Let $\mathbb P_x$ be the probability…

Probability · Mathematics 2016-07-28 Ion Grama , Ronan Lauvergnat , Émile Le Page

Let $\tau = (\tau_i : i \in {\Bbb Z})$ denote i.i.d.~positive random variables with common distribution $F$ and (conditional on $\tau$) let $X = (X_t : t\geq0, X_0=0)$, be a continuous-time simple symmetric random walk on ${\Bbb Z}$ with…

Probability · Mathematics 2007-05-23 L. R. G. Fontes , M. Isopi , C. M. Newman

We consider trap models on Z^d, namely continuous time Markov jump process on Z^d with embedded chain given by a generic discrete time random walk, and whose mean waiting time at x is given by tau_x, with tau = (tau_x, x in Z^d) a family of…

Probability · Mathematics 2017-05-17 Luiz Renato Fontes , Pierre Mathieu

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

Probability · Mathematics 2009-10-05 Lorenz A. Gilch , Sebastian Müller

Consider a family of random walks $S_n^{(a)}=X_1^{(a)}+\cdots+X_n^{(a)}$ with negative drift $\mathbf E X_1^{(a)}=-a<0$ and finite variance $\mbox{var}(X_1^{(a)})=\sigma^2<\infty$.Let $M^{(a)}=\max_{n\ge 0} S_n^{(a)}$ be the maximums of the…

Probability · Mathematics 2018-06-29 Denis Denisov , Johannes Kugler

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

Condensed Matter · Physics 2009-10-28 C. Godreche , J. M. Luck , M. R. Evans , D. Mukamel , S. Sandow , E. R. Speer

Suppose that $\{S_n,\ n\geq0\}$ is an asymptotically stable random walk. Let $g$ be a positive function and $T_g$ be the first time when $S_n$ leaves $[-g(n),\infty)$. In this paper we study asymptotic behaviour of $T_g$. We provide…

Probability · Mathematics 2014-03-25 Denis Denisov , Vitali Wachtel

We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…

Probability · Mathematics 2025-09-23 Wojciech Cygan , Tomislav Kralj , Nikola Sandrić , Stjepan Šebek , Andrew Wade , Mo Dick Wong

We consider elliptic random walks in i.i.d. random environments on $\mathbb{Z}^d$. The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for…

Probability · Mathematics 2015-06-30 Alexander Fribergh , Daniel Kious

This paper gives various asymptotic formulae for the transition probability associated with discrete time quantum walks on the real line. The formulae depend heavily on the `normalized' position of the walk. When the position is in the…

Probability · Mathematics 2017-11-15 Toshikazu Sunada , Tatsuya Tate

For the perimeter length $L_n$ and the area $A_n$ of the convex hull of the first $n$ steps of a planar random walk, this thesis study $n \to \infty$ mean and variance asymptotics and establish distributional limits. The results apply to…

Probability · Mathematics 2017-09-07 Chang Xu

Let $\left\{ S_{n},n\geq 0\right\} $ be a random walk whose increment distribution belongs without centering to the domain of attraction of an $% \alpha $-stable law, i.e., there are some scaling constants $a_{n}$ such that the sequence…

Probability · Mathematics 2023-12-19 Congzao Dong , Elena Dyakonova , Vladimir Vatutin

Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…

Probability · Mathematics 2009-02-18 Kilian Raschel

In a Markov chain started at a state $x$, the hitting time $\tau(y)$ is the first time that the chain reaches another state $y$. We study the probability $\mathbf{P}_x(\tau(y) = t)$ that the first visit to $y$ occurs precisely at a given…

Probability · Mathematics 2014-08-06 James Norris , Yuval Peres , Alex Zhai

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

Combinatorics · Mathematics 2010-09-27 Omer Angel , Alexander E. Holroyd