Related papers: The continuum self-similar tree

A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…

We give a quasi-isometric characterization of cacti, which is similar to Manning's characterization of quasi-trees by the bottleneck property. We also give another quasi-isometric characterization of cacti using fat theta curves.

We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…

Covtree - a partial order on certain sets of finite, unlabeled causal sets - is a manifestly covariant framework for causal set dynamics. Here, as a first step in picking out a class of physically well-motivated covtree dynamics, we study…

We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

This is a survey of the theory of real trees and their applications.

Contour trees have been developed to visualize or encode scalar data in imaging technologies and scientific simulations. Contours are defined on a continuous scalar field. For discrete data, a continuous function is first interpolated,…

In this note, we provide a new characterization of Aldous' Brownian continuum random tree as the unique fixed point of a certain natural operation on continuum trees (which gives rise to a recursive distributional equation). We also show…

Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

In this paper we give a metric construction of a tree which correctly identifies connected components of superlevel sets of $\mathbb{R}$-valued continuous functions $f$ on $X$ and show that it is possible to retrieve the $H_0$-persistent…

In this paper, we discuss topological aspects of the space of valuations $\mathbb{V}$ and the valuative tree $\mathcal{T}(v,\Lambda)$. We present a relation between the weak tree topology and the Scott topology in $\mathcal{T}(v,\Lambda)$…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…

We study the quasiclassical expansion associated with a complex curve. In a more specific context this is the 1/N expansion in U(N)-invariant matrix integrals. We compare two approaches, the CFT approach and the topological recursion, and…

Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for PSTs rely on exact matching between the suffix of the current sequence and the previously observed sequence. We…