Related papers: Inverting the cut-tree transform

Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…

Min-Cut queries are fundamental: Preprocess an undirected edge-weighted graph, to quickly report a minimum-weight cut that separates a query pair of nodes $s,t$. The best data structure known for this problem simply builds a cut-equivalent…

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

We present a construction of a L\'evy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to…

Given an ensemble of randomized regression trees, it is possible to restructure them as a collection of multilayered neural networks with particular connection weights. Following this principle, we reformulate the random forest method of…

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

In this article we survey properties of mixed Poisson distributions and probabilistic aspects of the Stirling transform: given a non-negative random variable $X$ with moment sequence $(\mu_s)_{s\in\mathbb{N}}$ we determine a discrete random…

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…

We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative…

We introduce three new cut tree structures of graphs $G$ in which the vertex set of the tree is a partition of $V(G)$ and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently,…

In this paper, we study both the direct and inverse random source problems associated with the multi-term time-fractional diffusion-wave equation driven by a fractional Brownian motion. Regarding the direct problem, the well-posedness is…

Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…

Employing a recent technology of tree surgery we prove a ``deletion-constriction'' formula for products of rooted spanning trees on weighted directed graphs that generalizes deletion-contraction on undirected graphs. The formula implies…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

Cheek and Johnston (Journal of Mathematical Biology, 2023) consider a continuous-time Bienaym\'e-Galton-Watson tree conditioned on being alive at time $T$. They study the reproduction events along the ancestral lineage of an individual…

Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…

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…