Related papers: Random walks on the discrete affine group

In this paper we study random walks on a finitely generated group $G$ which has a free action on a $\mathbb{Z}^n$-tree. We show that if $G$ is non-abelian and acts minimally, freely and without inversions on a locally finite…

What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a…

We determine all positive harmonic functions for a large class of "semi-isotropic" random walks on the lamplighter group, i.e., the wreath product of the cyclic group of order q with the infinite cyclic group. This is possible via the…

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…

We answer an open question of Grigorchuk and Zuk about amenability using random walks. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We show that many countable groups acting on trees, including free products of infinite countable groups and surface groups, are isomorphic to dense subgroups of isometry groups of bounded Urysohn spaces. This extends previous results of…

We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that these walks induce the natural…

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

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 a finite-dimensional, locally finite CAT(0) cube complex X admitting a co-compact properly discontinuous countable group of automorphisms G. We construct a natural compact metric space B(X) on which G acts by homeomorphisms, the…

Wildberger's construction enables us to obtain a hypergroup from a special graph via random walks. We will give a probability theoretic interpretation to products on the hypergroup. The hypergroup can be identified with a commutative…

We consider a one dimensional random-walk-like process, whose steps are centered Gaussians with variances which are determined according to the sequence of arrivals of a Poisson process on the line. This process is decorated by independent…

We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…

In this paper we study random walks on the hypergroup of circles in a finite field of prime order p = 4l + 3. We investigating the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use two…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

The study of actions of countable groups by automorphisms of compact abelian groups has recently undergone intensive development, revealing deep connections with operator algebras and other areas. The discrete Heisenberg group is the…

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…