Related papers: On cogrowth, amenability and the spectral radius o…
We consider the amenability of groupoids $G$ equipped with a group valued cocycle $c:G\to Q$ with amenable kernel $c^{-1}(e)$. We prove a general result which implies, in particular, that $G$ is amenable whenever $Q$ is amenable and if…
We investigate joint spectral characteristics of a family of matrices $\mathcal F $, associated with products in the semigroup generated by $\mathcal F$. In the literature, extremal measures such as the well-known joint spectral radius and…
We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…
Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
Beyond the locally compact case, equivalent notions of amenability diverge, and some properties no longer hold, for instance amenability is not inherited by topological subgroups. This investigation is guided by some amenability-type…
In this work, we address ergodicity of smooth actions of finitely generated semi-groups on an m-dimensional closed manifold M. We provide sufficient conditions for such an action to be ergodic with respect to the Lebesgue measure. Our…
We define the co-spectral radius of inclusions $\mathcal{S}\leq \mathcal{R}$ of discrete, probability measure-preserving equivalence relations, as the sampling exponent of a generating random walk on the ambient relation. The co-spectral…
Consider the tesselation of the hyperbolic plane by m-gons, l per vertex. In its 1-skeleton, we compute the growth series of vertices, geodesics, tuples of geodesics with common extremities. We also introduce and enumerate "holly trees", a…
We provide quantitative estimates in total variation distance for positive semi-groups, which can be non-conservative and non-homogeneous. The techniques relies on a family of conservative semigroups that describes a typical particle and…
We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…
We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…
We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
Let $G$ be a group acting properly by isometries and with a strongly contracting element on a geodesic metric space. Let $N$ be an infinite normal subgroup of $G$, and let $\delta_N$ and $\delta_G$ be the growth rates of $N$ and $G$ with…
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…
The main results in this paper are about the full coalescence time $\mathsf{C}$ of a system of coalescing random walks over a finite graph $G$. Letting $\mathsf{m}(G)$ denote the mean meeting time of two such walkers, we give sufficient…
We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…