Open and increasing paths on N-ary trees with different fitness values

Abstract

Consider a rooted N-ary tree. For every vertex of this tree, we atttach an i.i.d. Bernoulli random variable. A path is called open if all the random variables that are assigned on the path are 1. We consider limiting behaviors for the number of open paths from the root to leaves and the longest open path. In addition, when all fitness values are i.i.d. continuous random variables, some asymptotic properties of the longest increasing path are proved.