Related papers: Projective Fra\"{\i}ss\'{e} limits of trees

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…

We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…

Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…

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…

We show that a natural quotient of the projective Fraisse limit of a family that consists of finite rooted trees is the Lelek fan. Using this construction, we study properties of the Lelek fan and of its homeomorphism group. We show that…

Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This…

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…

We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…

We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…