Related papers: The continuum self-similar tree

Forward-time models of diversification (i.e., speciation and extinction) produce phylogenetic trees that grow "vertically" as time goes by. Pruning the extinct lineages out of such trees leads to natural models for reconstructed trees…

We introduce a transformation of finite integer sequences, show that every sequence eventually stabilizes under this transformation and that the number of fixed points is counted by the Catalan numbers. The sequences that are fixed are…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We consider a general metric Steiner problem which is of finding a set $\mathcal{S}$ with minimal length such that $\mathcal{S} \cup A$ is connected, where $A$ is a given compact subset of a given complete metric space $X$; a solution is…

Spatially Coherent Random Forest (SCRF) extends Random Forest to create spatially coherent labeling. Each split function in SCRF is evaluated based on a traditional information gain measure that is regularized by a spatial coherency term.…

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…

In this paper we consider the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods…

For supercritical multitype branching processes in continuous time, we investigate the evolution of types along those lineages that survive up to some time t. We establish almost-sure convergence theorems for both time and population…

We study a natural fragmentation process of the so-called stable tree introduced by Duquesne and Le Gall, which consists in removing the nodes of the tree according to a certain procedure that makes the fragmentation self-similar with…

We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a…

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…

We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…

We propose a novel tree-like curvilinear structure reconstruction algorithm based on supervised learning and graph theory. In this work we analyze image patches to obtain the local major orientations and the rankings that correspond to the…

Natural data offer a hard challenge to data analysis. One set of tools is being developed by several teams to face this difficult task: Persistent topology. After a brief introduction to this theory, some applications to the analysis and…

The Stochastic Context Tree (SCOT) is a useful tool for studying infinite random sequences generated by an m-Markov Chain (m-MC). It captures the phenomenon that the probability distribution of the next state sometimes depends on less than…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…

In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…

Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…

We characterize the spectrum of the transition matrix for simple random walk on graphs consisting of a finite graph with a finite number of infinite Cayley trees attached. We show that there is a continuous spectrum identical to that for a…