Related papers: An embedding for the Kesten-Spitzer random walk in…
Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…
Quantitative bounds for random embeddings of $\mathbb{R}^{k}$ into Lorentz sequence spaces are given, with improved dependence on $\varepsilon$.
We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…
We consider random walks in a balanced random environment in $\mathbb{Z}^d$, $d\geq 2$. We first prove an invariance principle (for $d\ge2$) and the transience of the random walks when $d\ge 3$ (recurrence when $d=2$) in an ergodic…
We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…
We establish via a probabilistic approach the quenched invariance principle for a class of long range random walks in independent (but not necessarily identically distributed) balanced random environments, with the transition probability…
In this paper, we study the number of moves in a multidimensional elephant random walk with stops. We establish several convergence results for the number of moves, including the law of large numbers and the law of iterated logarithm. Using…
In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Probabilistic models of random walks in random sceneries give rise to examples of probability-preserving dynamical systems. A point in the state spaces consists of a walk-trajectory and a scenery, and its `motion' corresponds to shifting…
Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being…
A new approach to stochastic integration is described, which is based on an a.s. pathwise approximation of the integrator by simple, symmetric random walks. Hopefully, this method is didactically more advantageous, more transparent, and…
We consider the almost sure asymptotic behavior of the periodogram of stationary and ergodic sequences. Under mild conditions we establish that the limsup of the periodogram properly normalized identifies almost surely the spectral density…
Intermittent stochastic processes appear in a wide field, such as chemistry, biology, ecology, and computer science. This paper builds up the theory of intermittent continuous time random walk (CTRW) and L\'{e}vy walk, in which the…