Increasing paths on N-ary trees

MaRDI QIDQ6249516zbMATH OpenFDO

Authors Xinxin Chen

Publication date 4 March 2014

Abstract: Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible vertices and kill all the others. For any positive constant $alpha$, we describe the asymptotic behaviors of the population at the $alphaN$-th generation as $N$ goes to infinity. We also study the criticality of the survival probability at the $(eN-frac32logN)$-th generation in this paper.

This page was built for publication: Increasing paths on N-ary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249516)