Related papers: Renewal theory on the oriented tree

The purpose of this paper is to build an algebraic framework suited to regularise branched structures emanating from rooted forests and which encodes the locality principle. This is achieved by means of the universal properties in the…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

We study fine structure related to finitely supported random walks on infinite finitely generated discrete groups, largely motivated by dimension group techniques. The unfaithful extreme harmonic functions (defined only on proper space-time…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

We prove that a smooth and connected algebraic group $G$ is affine if and only if any invertible sheaf on any normal $G$-variety is $G$-invariant. For the proof, a key ingredient is the following result: if $G$ is a connected and smooth…

The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…

The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of…

We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…

Random forests are ensemble methods which grow trees as base learners and combine their predictions by averaging. Random forests are known for their good practical performance, particularly in high dimensional set-tings. On the theoretical…

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

We study the local limit of the fixed-point forest, a tree structure associated to a simple sorting algorithm on permutations. This local limit can be viewed as an infinite random tree that can be constructed from a Poisson point process…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

We initiate the study of affine actions of groups on $\Lambda$-trees for a general ordered abelian group $\Lambda$; these are actions by dilations rather than isometries. This gives a common generalisation of isometric action on a…

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…

Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…

We carefully present an elementary proof of the well known theorem that each homotopy group (or, in degree zero, pointed set) of the inverse limit of a tower of fibrations maps naturally onto the inverse limit of the homotopy groups (or, in…

This paper is dedicated to the problem of infinite transitivity for algebraically generated automorphism groups of the affine plane. We provide a necessary and sufficient condition of infinite transitivity for a large family of subgroups…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…