We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we consider the number of simple paths from the root to a leaf along vertices with increasing labels. We show that if $\alpha = n/h$ is fixed and $\alpha > 1/e$, the probability there exists such a path converges to 1 as $h \to \infty$. This complements a previously known result that the probability converges to 0 if $\alpha \leq 1/e$.
Increasing paths in regular trees
Matthew I. Roberts,Lee Zhuo Zhao
Published 2013 in arXiv: Probability
ABSTRACT
PUBLICATION RECORD
- Publication year
2013
- Venue
arXiv: Probability
- Publication date
2013-05-03
- Fields of study
Biology, Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-13 of 13 references · Page 1 of 1
CITED BY
Showing 1-18 of 18 citing papers · Page 1 of 1