Related papers: Spread Out Random Walks on Homogeneous Spaces
Let $(g_n)_{n\geq 1}$ be a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group $\textrm{GL}(V)$, where $V=\mathbb R^d$. Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
The present paper originated from our previous study of the problem of harmonic analysis on the infinite symmetric group. This problem leads to a family {P_z} of probability measures, the z-measures, which depend on the complex parameter z.…
For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates…
In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
Continuing from the author's previous article 'Random walks and contracting elements I', we study random walks on (possibly asymmetric) metric spaces using the bounded geodesic image property (BGIP) of certain isometries. As an application,…
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…
We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
Homogeneous mass fragmentation processes describe the evolution of a unit mass that breaks down randomly into pieces as time. Mathematically speaking, they can be thought of as continuous-time analogues of branching random walks with…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.
Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…
On a locally compact group $E$ with countable base, we consider a random walk $X$ that has a unique (up to a positive factor) $r$-invariant measure for some $r>0$. Under some weak conditions on the measure, there is a unique continuous…