Related papers: Renewal theory on the oriented tree
Given a probability measure $\mu$ on a finitely generated group $\Gamma$, the Green function $G(x,y|r)$ encodes many properties of the random walk associated with $\mu$. Finding asymptotics of $G(x,y|r)$ as $y$ goes to infinity is a common…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
Random forests are a powerful method for non-parametric regression, but are limited in their ability to fit smooth signals, and can show poor predictive performance in the presence of strong, smooth effects. Taking the perspective of random…
In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
Let $G$ be a group. A function $G\rightarrow G$ of the form $x\mapsto x^{\alpha}g$ for a fixed automorphism $\alpha$ of $G$ and a fixed $g\in G$ is called an affine map of $G$. In this paper, we study finite groups $G$ with an affine map of…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
In the classical theorems of extreme value theory the limits of suitably rescaled maxima of sequences of independent, identically distributed random variables are studied. So far, only affine rescalings have been considered. We show,…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…
We obtain a strong renewal theorem with infinite mean beyond regular variation, when the underlying distribution belongs to the domain of geometric partial attraction a semistable law with index $\alpha\in (1/2,1]$. In the process we obtain…
Consider a finite renewal process in the sense that interrenewal times are positive i.i.d. variables and the total number of renewals is a random variable, independent of interrenewal times. A finite point process can be obtained by…
This article is one of a triptych composed with [Che25a] and [Che25b], that aims at proving an asymptotic expansion to any order of the passage probability of an irreducible equivariant finite range random walk on a tree. In this text we…
In [13], it is proved that any subgroup of $\mathrm{Diff}_{+}^{\omega }(I)$ (the group of orientation preserving analytic diffeomorphisms of the interval) is either metaabelian or does not satisfy a law. A stronger question is asked whether…
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…
Among all trees on $n$ vertices with a given degree sequence, how do we maximise or minimise the sum over all adjacent pairs of vertices $x$ and $y$ of $f(\mathrm{deg} x, \mathrm{deg} y)$? Here $f$ is a fixed symmetric function satisfying a…
While balancing covariates between groups is central for observational causal inference, selecting which features to balance remains a challenging problem. Kernel balancing is a promising approach that first estimates a kernel that captures…
Let T be the homogeneous tree with degree and G a finitely generated group whose Cayley graph is T. The associated lamplighter group is the wreath product of the cyclic group of order r with G. For a large class of random walks on this…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…