Related papers: Tree substitutions and Rauzy fractals
We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model that optimally…
We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…
For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…
Consider a periodic tiling of a plane by equal triangles obtained from the equilateral tiling by a linear transformation. We study a following tiling billiard: a ball follows straight segments and bounces of the boundaries of the tiles into…
A method to approximately close the dynamic cavity equations for synchronous reversible dynamics on a locally tree-like topology is presented. The method builds on $(a)$ a graph expansion to eliminate loops from the normalizations of each…
We examine a pair of dynamical systems on the plane induced by a pair of spanning trees in the Cayley graph of the Super-Apollonian group of Graham, Lagarias, Mallows, Wilks and Yan. The dynamical systems compute Gaussian rational…
The unitary representation theory of locally compact contraction groups and their semi-direct products with $\mathbb{Z}$ is studied. We put forward the problem of completely characterising such groups which are type I or CCR and this…
Let $f$ be an orientation preserving homeomorphisms on the circle with several break points, that is, its derivative $Df$ has jump discontinuities at these points. We study Rauzy-Veech renormalizations of piecewise smooth circle…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $\epsilon$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures…
Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…
In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this first paper, we give a…
We consider a real-valued path; it is possible to associate a tree to this path, and we explore the relations between the tree, the properties of $p$-variation of the path, and integration with respect to the path. In particular, the…
We revisit a graph width parameter that we dub bipartite treewidth (btw). Bipartite treewidth can be seen as a common generalization of treewidth and the odd cycle transversal number, and is closely related to odd-minors. Intuitively, a…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
First, we briefly review the Coset Space Dimensional Reduction scheme and the results of the best model so far. Then, we present the introduction of fuzzy coset spaces used as extra dimensions and perform a dimensional reduction. In turn,…
Replica symmetry breaking postulates that near optima of spin glass Hamiltonians have an ultrametric structure. Namely, near optima can be associated to leaves of a tree, and the Euclidean distance between them corresponds to the distance…
This paper introduces a method to extract a hierarchical tree representation from 3D unorganized polygonal data. The proposed approach first extracts a graph representation of the surface, which serves as the foundation for structural…
We consider dynamic random trees constructed using an attachment function $f : \mathbb{N} \to \mathbb{R}_+$ where, at each step of the evolution, a new vertex attaches to an existing vertex $v$ in the current tree with probability…
We prove the existence of an automorphism-invariant coupling for the wired and the free uniform spanning forests on Cayley graphs of finitely generated residually amenable groups.
This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture…