Related papers: The CLT for lamplighter groups with an acylindrica…
We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory which exhibits a phase transition from diffusive to superdiffusive behaviour. We prove a law of large…
In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…
Using an averaged generating function for coloured hard-dimers, some random variables of interest are studied. The main result lies in the fact that all their probability distributions obey a central limit theorem.
A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered…
We investigate random walks on the general linear group constrained within a specific domain, with a focus on their asymptotic behavior. In a previous work [38], we constructed the associated harmonic measure, a key element in formulating…
We establish central limit theorems for an action of a group G on a hyperbolic space X with respect to the counting measure on a Cayley graph of G. Our techniques allow us to remove the usual assumptions of properness and smoothness of the…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
In this paper, we extend a result of Kesten and Spitzer (1979). Let us consider a stationary sequence $(\xi\_k:=f(T^k(.)))\_k$ given by an invertible probability dynamical system and some centered function $f$. Let $(S\_n)\_n$ be a simple…
We discuss the spectral asymptotics of some open subsets of the real line with random fractal boundary and of a random fractal, the continuum random tree. In the case of open subsets with random fractal boundary we establish the existence…
A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…
We prove that every acylindrically hyperbolic group admits a minimal and extremely proximal action on a compact metrizable space. If there are no nontrivial finite normal subgroups, then the action is topologically free. This answers…
In recent years, considerable interest has been drawn by the analysis of geometric functionals for the excursion sets of random eigenfunctions on the unit sphere (spherical harmonics). In this paper, we extend those results to proper…
We consider deterministic random walks on the real line driven by irrational rotations, or equivalently, skew product extensions of a rotation by $\alpha$ where the skewing cocycle is a piecewise constant mean zero function with a jump by…
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…
We use a method developed by Bj\"orklund and Gorodnik to show a central limit theorem (as $T$ tends to $\infty$) for the counting functions $\# \left( \Lambda \cap \Omega_T \right)$ where $\Lambda$ ranges over the space $Y_{2d}$ of…
We generalise Merzlyakov's theorem about the first-order theory of non-abelian free groups to all acylindrically hyperbolic groups. As a corollary, we deduce that if $G$ is an acylindrically hyperbolic group and $E(G)$ denotes the unique…
A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the corresponding Cayley graph is a…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
In the present paper, we study long time asymptotics of non-symmetric random walks on crystal lattices from a view point of discrete geometric analysis due to Kotani and Sunada [11, 23]. We observe that the Euclidean metric associated with…
In this paper we show the statement in the title. To any Garside group of finite type, Wiest and the author associated a hyperbolic graph called the \emph{additional length graph} and they used it to show that central quotients of…