Related papers: Finding Adam in random growing trees

The reconstruction of large phylogenetic trees from data that violates clocklike evolution (or as a supertree constructed from any m input trees) raises a difficult question for biologists - how can one assign relative dates to the vertices…

In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with…

We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathbb{N}$, generated by sequentially embedding vertices…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's properties, and with a prescribed probability of failure. We…

We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…

We study the asymptotic behavior of the maximum degree in the evolving tree model with a choice based on both degree and fitness of a vertex. The tree is constructed in the following recursive way. Each vertex is assigned a parameter to it…

Bollob\'as-Riordan random pairing model of a preferential attachment graph $G_m^n$ is studied. Let $\{W_j\}_{j\le mn+1}$ be the process of sums of independent exponentials with mean $1$. We prove that the degrees of the first…

Polytrees are a subclass of Bayesian networks that seek to capture the conditional dependencies between a set of $n$ variables as a directed forest and are motivated by their more efficient inference and improved interpretability. Since the…

We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution…

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a "preferential attachment" rule: the current vertex selects an image i with probability proportional to a given…

In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…

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…

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…

We give an algorithm that, given an $n$-vertex graph $G$ and an integer $k$, in time $2^{O(k)} n$ either outputs a tree decomposition of $G$ of width at most $2k + 1$ or determines that the treewidth of $G$ is larger than $k$. This is the…

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is the number of vertices, and k is the size of the largest…

'Tree-based' phylogenetic networks proposed by Francis and Steel have attracted much attention of theoretical biologists in the last few years. At the heart of the definitions of tree-based phylogenetic networks is the notion of 'support…