Related papers: Random walks on Bratteli diagrams

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

Random paths are time continuous interpolations of random walks. By using Littelmann path model, we associate to each irreducible highest weight module of a Kac Moody algebra g a random path W. Under suitable hypotheses, we make explicit…

We show the existence of a trace process at infinity for random walks on hyperbolic groups of conformal dimension < 2 and relate it to the existence of a reflecting random walk. To do so, we employ the theory of Dirichlet forms which…

Random walks in cones have the double interest of being at the heart of many probabilistic problems and of being related to many mathematical fields, such as spectral theory, combinatorics, or discrete complex analysis. In this article, we…

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

We consider a random walk $S_k$ with i.i.d. steps on a compact group equipped with a bi-invariant metric. We prove quantitative ergodic theorems for the sum $\sum_{k=1}^N f(S_k)$ with H\"older continuous test functions $f$, including the…

Classical random walks and Markov processes are easily described by Hopf algebras. It is also known that groups and Hopf algebras (quantum groups) lead to classical and quantum diffusions. We study here the more primitive notion of a…

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…

In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…

We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step…

We study boundaries arising from limits of ratios of transition probabilities for random walks on relatively hyperbolic groups. We extend, as well as determine significant limitations of, a strategy employed by Woess for computing…

We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…

We study the random planar maps obtained from supercritical Galton--Watson trees by adding the horizontal connections between successive vertices at each level. These are the hyperbolic analog of the maps studied by Curien, Hutchcroft and…

We construct a coupling between the random walk composed of L\'evy area increments from a $d$-dimensional Brownian motion and a random walk composed of quadratic polynomials of Gaussian random variables. This coupling construction is used…

This paper presents the strong law of large numbers for a function of the local times of a transient random walk on groups, extending the research of Asymont and Korshunov for random walks on the integer lattice $\mathbb{Z}^d$. Under some…

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…

Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…

Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…