Increasing paths on N-ary trees

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 $\alpha N$-th generation as $N$ goes to infinity. We also study the criticality of the survival probability at the $(eN-\frac{3}{2}\log N)$-th generation in this paper.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00955505
Author Chen, Xinxin
Maintainer CCSD
Last Updated May 6, 2026, 03:37 (UTC)
Created May 6, 2026, 03:37 (UTC)
Identifier hal-00955505
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire de Probabilités et Modèles Aléatoires (LPMA) ; Université Pierre et Marie Curie - Paris 6 (UPMC)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
creator Chen, Xinxin
date 2014-03-04T00:00:00
harvest_object_id 0896d7e1-6fbf-401c-8114-db5dab1c9065
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-09-29T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1403.0843
set_spec type:UNDEFINED