English
Related papers

Related papers: Growing Trees and Amoebas' Replications

200 papers

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the…

Probability · Mathematics 2007-05-23 Robin Pemantle

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Combinatorics · Mathematics 2017-02-08 Song Guo , Victor J. W. Guo

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

Combinatorics · Mathematics 2024-01-11 George Barmpalias , Xiaoyan Zhang

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…

Combinatorics · Mathematics 2019-10-30 Olivier Bodini , Antoine Genitrini , Bernhard Gittenberger , Stephan Wagner

Understanding why we age is a long-lived open problem in evolutionary biology. Aging is prejudicial to the individual and evolutionary forces should prevent it, but many species show signs of senescence as individuals age. Here, I will…

Populations and Evolution · Quantitative Biology 2012-01-24 André C. R. Martins

Although species longevity is subject to a diverse range of selective forces, the mortality curves of a wide variety of organisms are rather similar. We argue that aging and its universal characteristics may have evolved by means of a…

Populations and Evolution · Quantitative Biology 2013-02-01 Dervis Can Vural , Greg Morrison , L. Mahadevan

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…

Combinatorics · Mathematics 2018-02-20 Audace Amen Vioutou Dossou-Olory , Stephan Wagner

The constant rate birth--death process is a popular null model for speciation and extinction. If one removes extinct and non-sampled lineages, this process induces `reconstructed trees' which describe the relationship between extant…

Probability · Mathematics 2011-08-01 Tanja Stadler , Mike Steel

How multicellular life forms evolved out from unicellular ones constitutes a major problem in our understanding of the evolution of our biosphere. A recent set of experiments involving yeast cell populations has shown that selection for…

Populations and Evolution · Quantitative Biology 2015-11-10 Salva Duran-Nebreda , Ricard V. Solé

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Probability · Mathematics 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

We study the weak limit of the arboreal gas along any exhaustion of a regular tree with wired boundary conditions. We prove that this limit exists, does not depend on the choice of exhaustion, and undergoes a phase transition. Below and at…

Probability · Mathematics 2021-08-11 Philip Easo

We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.

Combinatorics · Mathematics 2008-12-12 Mykhaylo Tyomkyn

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

Probability · Mathematics 2021-08-03 Arnold Saunders

Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…

Combinatorics · Mathematics 2007-05-23 Vince Vatter

We calculate the density and expectation for the number of lineages in a reconstructed tree with $n$ extant species. This is done with conditioning on the age of the tree as well as with assuming a uniform prior for the age of the tree.

Probability · Mathematics 2007-11-05 Tanja Gernhard , Dennis Wong

We investigate a model of cell division in which the length of telomeres within the cell regulate their proliferative potential. At each cell division the ends of linear chromosomes change and a cell becomes senescent when one or more of…

Cell Behavior · Quantitative Biology 2008-04-23 T. Antal , K. B. Blagoev , S. A. Trugman , S. Redner

A plane rooted tree is called a hipster tree if it has no nontrivial automorphisms. Equivalently, a tree is a hipster tree if no two siblings have isomorphic subtrees. We impose the hipster condition on various classes of rooted trees. By…

Combinatorics · Mathematics 2024-04-29 Alexander Wong

A major task of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on a tree. Given samples from the leaves of the Markov chain, the goal is to reconstruct…

Probability · Mathematics 2011-09-30 Constantinos Daskalakis , Elchanan Mossel , Sebastien Roch

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

Discrete Mathematics · Computer Science 2016-02-02 Fabrizio Luccio

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle