Increasing paths in regular trees
From MaRDI portal
Abstract: We consider a regular -ary tree of height , 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 is fixed and , the probability there exists such a path converges to 1 as . This complements a previously known result that the probability converges to 0 if .
Recommendations
Cited in
(11)- Evolutionary accessibility of modular fitness landscapes
- Phase transition for accessibility percolation on hypercubes
- RMF accessibility percolation on oriented graphs
- Increasing paths in countable graphs
- Galton-Watson processes in varying environment and accessibility percolation
- Accessibility percolation with crossing valleys on \(n\)-ary trees
- On the existence of accessibility in a tree-indexed percolation model
- Accessibility percolation on random rooted labeled trees
- Accessibility percolation with backsteps
- The number of accessible paths in the hypercube
- scientific article; zbMATH DE number 5585075 (Why is no real title available?)
This page was built for publication: Increasing paths in regular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743062)