Related papers: Random walks on Baumslag-Solitar groups

The Baumslag-Solitar groups: BS(m,n)=<x,y| x y^{m} x^{-1} = y^{n}> are some of the simplest interesting infinite groups which are not lattices in Lie groups. They have been studied in depth from the point of view of combinatorial group…

We show that a random walk on the mapping class group of an orientable surface gives rise to a pseudo-Anosov element with asymptotic probability one. Our methods apply to many subgroups of the mapping class group, including the Torelli…

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…

Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses…

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…

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…

We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…

In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…

When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…

We give sufficient conditions for the non-triviality of the Poisson boundary of random walks on $H(\mathbb{Z})$ and its subgroups. The group $H(\mathbb{Z})$ is the group of piecewise projective homeomorphisms over the integers defined by…

We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…

We study a discrete time multitype branching random walk on a finite space with finite set of types. Particles follow a Markov chain on the spatial space whereas offspring distributions are given by a random field that is fixed throughout…

We give an alternative proof of a result by N. Gantert, Y. Hu and Z. Shi on the asymptotic behavior of the survival probability of the branching random walk killed below a linear boundary, in the special case of deterministic binary…

The stochastic properties of variables whose addition leads to $q$-Gaussian distributions $G_q(x)=[1+(q-1)x^2]_+^{1/(1-q)}$ (with $q\in\mathbb{R}$ and where $[f(x)]_+=max\{f(x),0\}$) as limit law for a large number of terms are…

We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…

We give an expression of the speed of the biased random walk on a Galton--Watson tree. In the particular case of the simple random walk, we recover the result of Lyons, Pemantle and Peres \cite{LyPePe95}. The proof uses a description of the…

Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing…

We investigate invariants for random elements of different hyperbolic groups. We provide a method, using Cayley graphs of groups, to compute the probability distribution of the minimal length of a random word, and explicitly compute the…