Related papers: Return Probability for the Switch--Walk--Switch La…

Let $S_n$ be a centered random walk with a finite variance, and define the new sequence $A_n:=\sum_{i=1}^n S_i$, which we call an integrated random walk. We are interested in the asymptotics of $$p_N:=P(\min_{1 \le k \le N} A_k \ge 0)$$ as…

Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…

A connection between the asymptotic behavior of the open quantum walk and the spectrum of a generalized quantum coins is studied. For the case of simultaneously diagonalizable transition operators an exact expression for probability…

In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…

This article is one of a triptych composed with [Che25a] and [Che25b], that aims at proving an asymptotic expansion to any order of the passage probability of an irreducible equivariant finite range random walk on a tree. In this text we…

We analyze a random walk strategy on undirected regular networks involving power matrix functions of the type $L^{\frac{\alpha}{2}}$ where $L$ indicates a `simple' Laplacian matrix. We refer such walks to as `Fractional Random Walks' with…

We settle an open problem, raised by Y. Peres and D. Revelle, concerning the $L^2$ mixing time of the random walk on the lamplighter graph. We also provide general bounds relating the entropy decay of a Markov chain to the separation…

In this article we prove existence of the asymptotic capacity of the range of random walks on free products of graphs. In particular, we will show that the asymptotic capacity of the range is almost surely constant and strictly positive.…

We study the path behavior of the anisotropic random walk on the two-dimensional lattice Z^2. Simultaneous strong approximations of its components are given.

We investigate the random loop model on the $d$-ary tree. For $d \geq 3$, we establish a (locally) sharp phase transition for the existence of infinite loops. Moreover, we derive rigorous bounds that in principle allow to determine the…

We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…

We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…

We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on ${\mathbb{Z}}^d$. The two-point functions of these models are respectively the generating function for self-avoiding walks from…

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

Asymptotic results are derived for the number of random walks in alcoves of affine Weyl groups (which are certain regions in $n$-dimensional Euclidean space bounded by hyperplanes), thus solving problems posed by Grabiner [J. Combin. Theory…

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…

We derive Donsker-Vardhan type results for functionals of the occupation times when the underlying random walk on $\mathbb Z^d$ is in the domain of attraction of an operator-stable law on $\mathbb R^d$. Applications to random walks on…

The lamplighter group over $\mathbb Z$ is the wreath product $\mathbb Z_q \wr \mathbb Z$. With respect to a natural generating set, its Cayley graph is the Diestel-Leader graph $DL(q,q)$. We study harmonic functions for the "simple"…