相关论文: Constructing non-uniquely ergodic arational trees
We define the concept of an ultrametric M\"obius space and use this to characterize nonelementary geodesically complete trees.
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…
A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…
In this article we gave the notion of particular type of functions on a group termed as class assigned functions . Using class assigned functions, we have constructed several right gyrogroup structures on a given non-abelian group.
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
This article is a conceptual exposition on the structure of the tree. It demonstrates an evolutionary design that the tree possesses in the perspective of a structural engineer.
We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…
Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using $O(n\log n)$ time in…
We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations and experimentally verify its performance on tessellations.
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…
We show that various categories of trees can be modeled by Grothendieck constructions on categories of trees with a fixed set of leaves. We prove this result for the dendroidal category $\Omega$, the category $\Omega^G$ of trees with a…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
Arc-standard derivations over projective dependency trees can be interpreted as the incremental construction of lexicalized ordered trees with contiguous yields. Each \textsc{shift}, \textsc{leftarc}, and \textsc{rightarc} transition…
We will present several examples in which ideas from ergodic theory can be useful to study some problems in arithmetic and algebraic geometry.
Bayesian Decision Trees are known for their probabilistic interpretability. However, their construction can sometimes be costly. In this article we present a general Bayesian Decision Tree algorithm applicable to both regression and…
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…
In this paper, we consider the problem of reconstructing trees from traces in the tree edit distance model. Previous work by Davies et al. (2019) analyzed special cases of reconstructing labeled trees. In this work, we significantly expand…
There are different concepts regarding to tree decomposition of a graph $G$. For the Hypercube $Q_n$, these concepts have been shown to have many applications. But some diverse papers on this subject make it difficult to follow what is…
To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava's factorials to a natural combinatorial setting suitable for studying questions around…