Related papers: Limit set of branching random walks on hyperbolic …
In this paper, we study the overlap distribution and Gibbs measure of the Branching Random Walk with Gaussian increments on a binary tree. We first prove that the Branching Random Walk is 1 step Replica Symmetry Breaking and give a precise…
We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton--Watson (GW) tree with offspring distribution $\nu$. The…
In this work, the transition between diffusion-limited and ballistic aggregation models was revisited using a model in which biased random walks simulate the particle trajectories. The bias is controlled by a parameter $\lambda$, which…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
Let $G$ be a real linear semisimple algebraic group without compact factors and $\Gamma$ a Zariski dense subgroup of $G$. In this paper, we use a probabilistic counting in order to study the asymptotic properties of $\Gamma$ acting on the…
We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…
At each point of a Poisson point process of intensity $\lambda$ in the hyperbolic place, center a ball of bounded random radius. Consider the probability $P_r$ that from a fixed point, there is some direction in which one can reach distance…
We consider random iteration of exponential entire functions, i.e. of the form ${\mathbb C}\ni z\mapsto f_\lambda(z):=\lambda e^z\in\mathbb C$, $\lambda\in{\mathbb C}\setminus \{0\}$. Assuming that $\lambda$ is in a bounded closed interval…
The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…
The rate of convergence of simple random walk on the Heisenberg group over $Z/nZ$ with a standard generating set was determined by Bump et al [1,2]. We extend this result to random walks on the same groups with an arbitrary minimal…
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…
Concentration inequalities, which have proved very useful in a variety of fields, provide fairly tight bounds on large deviation probabilities while central limit theorem (CLT) describes the asymptotic distribution around the mean (at the…
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.
Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…
Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…
Consider a random walk $(S_n:n\geq0)$ with drift $-\mu$ and $S_0=0$. Assuming that the increments have exponential moments, negative mean, and are strongly nonlattice, we provide a complete asymptotic expansion (in powers of $\mu>0$) that…
Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…