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 radius is analogous to the spectral radius for random walks on $G/H$ for inclusion $H\leq G$ of groups. The almost sure existence of the sampling exponent is already new for i.i.d. percolation clusters on countable groups. For the proof, we develop a general method called 2-3-method that is based on the mass-transport principle. As a byproduct, we show that the growth of a unimodular random rooted tree of bounded degree always exists, assuming its upper growth passes a critical threshold. This complemen...
Research Doctorate - Doctor of Philosophy (PhD)Amenability can be characterised in many ways, and ma...
AbstractWe compute the exact asymptotic normalizations of random walks in random sceneries, for vari...
We prove a metric space scaling limit for a critical random graph with independent and identically d...
The notion of spectral dimensionality of a self-similar (fractal) structure is recalled, and its val...
v2: added a geometric interpretation of the lower boundEstimating numerically the spectral radius of...
We introduce two natural notions of cogrowth for finitely generated semigroups - one local and one g...
Random walks on a graph reflect many of its topological and spectral properties, such as connectedne...
In the mean field (or random link) model there are n points and inter-point distances are independen...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriente...
This thesis concerns the diameter and spectral gap of finite groups. Our focus shall be on the asymp...
We show that the range of a critical branching random walk conditioned to survive forever and the Mi...
. For a large class of Markov operators on trees we prove the formula HD = h=l connecting the Haus...
43 pages, 3 figuresInternational audienceWe establish spectral theorems for random walks on mapping ...
Research Doctorate - Doctor of Philosophy (PhD)Amenability can be characterised in many ways, and ma...
AbstractWe compute the exact asymptotic normalizations of random walks in random sceneries, for vari...
We prove a metric space scaling limit for a critical random graph with independent and identically d...
The notion of spectral dimensionality of a self-similar (fractal) structure is recalled, and its val...
v2: added a geometric interpretation of the lower boundEstimating numerically the spectral radius of...
We introduce two natural notions of cogrowth for finitely generated semigroups - one local and one g...
Random walks on a graph reflect many of its topological and spectral properties, such as connectedne...
In the mean field (or random link) model there are n points and inter-point distances are independen...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered pr...
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriente...
This thesis concerns the diameter and spectral gap of finite groups. Our focus shall be on the asymp...
We show that the range of a critical branching random walk conditioned to survive forever and the Mi...
. For a large class of Markov operators on trees we prove the formula HD = h=l connecting the Haus...
43 pages, 3 figuresInternational audienceWe establish spectral theorems for random walks on mapping ...
Research Doctorate - Doctor of Philosophy (PhD)Amenability can be characterised in many ways, and ma...
AbstractWe compute the exact asymptotic normalizations of random walks in random sceneries, for vari...
We prove a metric space scaling limit for a critical random graph with independent and identically d...