Related papers: From Hammersley's lines to Hammersley's trees
We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together line-segments one by one. The lengths of…
The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…
We revisit the model of the ballistic deposition studied in \cite{bdeposition} and prove several combinatorial properties of the random tree structure formed by the underlying stochastic process. Our results include limit theorems for the…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
We give combinatorial descriptions of two stochastic growth models for series-parallel networks introduced by Hosam Mahmoud by encoding the growth process via recursive tree structures. Using decompositions of the tree structures and…
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…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
Neural Networks and Decision Trees: two popular techniques for supervised learning that are seemingly disconnected in their formulation and optimization method, have recently been combined in a single construct. The connection pivots on…
The problem of time-series clustering is considered in the case where each data-point is a sample generated by a piecewise stationary ergodic process. Stationary processes are perhaps the most general class of processes considered in…
This note is motivated by connections between the online and offline problems of selecting a possibly long subsequence from a Poisson-paced sequence of uniform marks under either a monotonicity or a sum constraint. The offline problem with…
The Pearcey process is a universal point process in random matrix theory. In this paper, we study the generating function of the Pearcey process on any number $m$ of intervals. We derive an integral representation for it in terms of a…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
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.…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
We study a universal object for the genealogy of a sample in populations with mutations: the critical birth-death process with Poissonian mutations, conditioned on its population size at a fixed time horizon. We show how this process arises…
It is well known that, under broad assumptions, the time-scaled point process of exceedances of a high level by a stationary sequence converges to a compound Poisson process as the level grows. The purpose of this note is to demonstrate…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…