Increasing paths in regular trees

From MaRDI portal




Abstract: 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 hoinfty. This complements a previously known result that the probability converges to 0 if alphaleq1/e.









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)