Related papers: Amenability of trees
In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…
The purpose of this article is prove that Thompson's group F is amenable. The methods developed will then be used to prove a generalization of Hindman's theorem for the free nonassociative binary system on one generator.
We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
We use the output of a random forest to define a family of local smoothers with spatially adaptive bandwidth matrices. The smoother inherits the flexibility of the original forest but, since it is a simple, linear smoother, it is very…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
We show that if $G$ is an amenable topological group, then the topological group $L^{0}(G)$ of strongly measurable maps from $([0,1],\lambda)$ into $G$ endowed with the topology of convergence in measure is whirly amenable, hence extremely…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to…
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…
We present sufficient conditions for HNN extensions to be inner amenable, respectively ICC, which give necessary and sufficient criteria among Baumslag-Solitar groups. We deduce that such a group, viewed as acting on its Bass-Serre tree,…
We give characterizations for the parabolicity of regular trees.
A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some…
We survey results from amenability theory with an emphasis on applications to harmonic analysis on direct-limit groups.
We first present our view of detection and correction of syntactic errors. We then introduce a new correction method, based on heuristic criteria used to decide which correction should be preferred. Weighting of these criteria leads to a…
In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the…
Multi-target regression is useful in a plethora of applications. Although random forest models perform well in these tasks, they are often difficult to interpret. Interpretability is crucial in machine learning, especially when it can…
This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graphs, requires the introduction of a generalization of binary…
Generalizing Block and Weinberger's characterization of amenability we introduce the notion of uniformly finite homology for a group action on a compact space and use it to give a homological characterization of topological amenability for…