Growth of Random Trees by Leaf Attachment

by   Nomvelo Sibisi, et al.

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the merging of directed ordered paths from leaves to the root. Combining the likelihood with an assigned prior distribution leads to a posterior leaf distribution from which we sample attachment points for new vertices. We present computational examples of such Bayesian tree growth. Although the discussion is generic, the initial motivation for the paper is the concept of a distributed ledger, which may be regarded as a time-ordered random tree that grows by probabilistic leaf attachment.



page 14

page 15

page 16

page 17

page 18


An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time

Trees are useful entities allowing to model data structures and hierarch...

A Cluster Model for Growth of Random Trees

We first consider the growth of trees by probabilistic attachment of new...

The k-in-a-tree problem for graphs of girth at least k

For all integers k≥ 3, we give an O(n^4) time algorithm for the problem ...

An algorithm for generating random mixed-arity trees

Inspired by [4] we present a new algorithm for uniformly random generati...

Root and community inference on the latent growth process of a network using noisy attachment models

We introduce the PAPER (Preferential Attachment Plus Erdős–Rényi) model ...

Upward Point Set Embeddings of Paths and Trees

We study upward planar straight-line embeddings (UPSE) of directed trees...

On the widths of regular and context free languages, with an application to information flow

Given a partially-ordered finite alphabet Σ and a language L ⊆Σ^*, how l...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.