English
Related papers

Related papers: Growing Trees and Amoebas' Replications

200 papers

We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…

Information Theory · Computer Science 2017-04-21 Thomas Hirschler , Wolfgang Woess

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…

Logic · Mathematics 2007-11-21 Rüdiger Göbel , Saharon Shelah

We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends…

Probability · Mathematics 2016-05-11 Anne-Laure Basdevant , Lucas Gerin , Jean-Baptiste Gouere , Arvind Singh

Demographic data and recent experiments verify earlier predictions that mortality has short (few percent of the life span) memory of the previous life history, may be significantly decreased, reset to its value at a much younger age, and…

Quantitative Methods · Quantitative Biology 2007-05-23 Mark Ya. Azbel'

We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…

Probability · Mathematics 2018-12-27 V. A. Vatutin , E. E. Dyakonova

Exploration and trapping properties of random walkers that may evanesce at any time as they walk have seen very little treatment in the literature, and yet a finite lifetime is a frequent occurrence, and its effects on a number of random…

Statistical Mechanics · Physics 2013-06-19 S. B. Yuste , E. Abad , Katja Lindenberg

A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some…

Adaptation and Self-Organizing Systems · Physics 2019-07-24 Olivier Bui , Xavier Leoncini

We study the Tree Builder Random Walk: a randomly growing tree, built by a walker as she is walking around the tree. Namely, at each time $n$, she adds a leaf to her current vertex with probability $p_n \asymp n^{-\gamma}$, $\gamma\in…

Probability · Mathematics 2024-12-09 Janos Engländer , Giulio Iacobelli , Gábor Pete , Rodrigo Ribeiro

In this paper we derive a statistical law of Life. It governs the probability of death, or complementary of survival, of the living organisms. We have deduced such a law coupling the widely used Weibull statistics, developed for describing…

Populations and Evolution · Quantitative Biology 2007-05-23 N. M. Pugno

We combine the Penna Model for biological aging, which is based on the mutation-accumulation theory, with a sort of antagonistic pleiotropy. We show that depending on how the pleiotropy is introduced, it is possible to reproduce both the…

Statistical Mechanics · Physics 2009-11-07 A. O. Sousa , S. Moss de Oliveira

Lifespan distributions of populations of quite diverse species such as humans and yeast seem to surprisingly well follow the same empirical Gompertz-Makeham law, which basically predicts an exponential increase of mortality rate with age.…

Quantitative Methods · Quantitative Biology 2011-10-18 André Grüning , Aasis Vinayak PG

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…

Logic in Computer Science · Computer Science 2026-01-23 Thorsten Wißmann , Bálint Kocsis , Jurriaan Rot , Ruben Turkenburg

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

Populations and Evolution · Quantitative Biology 2022-11-08 Johannes Wirtz

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Aehlig

Models of bacterial growth tend to be `irreversible', allowing for the number of bacteria in a colony to increase but not to decrease. By contrast, models of molecular self-assembly are usually `reversible', allowing for addition and…

Statistical Mechanics · Physics 2017-10-18 Katherine Klymko , Juan P. Garrahan , Stephen Whitelam

We propose the following simple stochastic model for phylogenetic trees. New types are born and die according to a birth and death chain. At each birth we associate a fitness to the new type sampled from a fixed distribution. At each death…

Probability · Mathematics 2013-06-29 T. M. Liggett , R. B. Schinazi

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

We present a model for biological aging that considers the number of individuals whose (inherited) genetic charge determines the maximum age for death: each individual may die before that age due to some external factor, but never after…

adap-org · Physics 2008-02-03 R. M. C. de Almeida , S. Moss de Oliveira , T. J. P. Penna

Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data, while the true time of death for some instances is unknown. Survival trees enable the discovery of complex nonlinear…

Machine Learning · Computer Science 2024-01-10 Tim Huisman , Jacobus G. M. van der Linden , Emir Demirović

We consider random walks amongst random conductances in the cases where the conductances can be arbitrarily small, with a heavy-tailed distribution at 0, and where the conductances may or may not have a heavy-tailed distribution at…

Probability · Mathematics 2024-02-19 David A. Croydon , Daniel Kious , Carlo Scali
‹ Prev 1 3 4 5 6 7 10 Next ›