Related papers: Trees on hyperbolic honeycombs
Hyperbolic geometry is developed in a purely algebraic fashion from first principles, without a prior development of differential geometry. The natural connection with the geometry of Lorentz, Einstein and Minkowski comes from a projective…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
In this third paper, we revisit the question to which extent the properties of the trees associated to the tilings $\{p,4\}$ of the hyperbolic plane are still true if we consider a finitely generated tree by the same rules but rooted at a…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
Let X be a tree of proper geodesic spaces with edge spaces strongly contracting and uniformly separated from each other by a number depending on the contraction function of edge spaces. Then we prove that the strongly contracting geodesics…
A ubiquitous motif in nature is the self-similar hierarchical buckling of a thin lamina near its margins. This is seen in leaves, flowers, fungi, corals, and marine invertebrates. We investigate this morphology from the perspective of…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…
We prove that the semistability growth of hyperbolic groups is linear, which implies that hyperbolic groups which are sci (simply connected at infinity) have linear sci growth. Based on the linearity of the end-depth of finitely presented…
To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
The independent set sequence of trees has been well studied, with much effort devoted to the (still open) question of Alavi, Malde, Schwenk and Erd\H{o}s on whether the independent set sequence of a tree is always unimodal. Much less…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
Large language models (LLMs) have achieved remarkable success and demonstrated superior performance across various tasks, including natural language processing (NLP), weather forecasting, biological protein folding, text generation, and…
We prove a combination theorem for trees of (strongly) relatively hyperbolic spaces and finite graphs of (strongly) relatively hyperbolic groups. This gives a geometric extension of Bestvina and Feighn's Combination Theorem for hyperbolic…
Given a geodesic line $\gamma$ the hyperbolic space $\mathbb H^n$ we formulate a necessary and sufficient condition for a function along this geodesic which measure the mean curvature of totally umbilical leaves of a foliation orthogonal to…
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…