Increasing Paths on N-ary Trees
Acta Mathematica Sinica, English Series · 2026-06 · 42 (6) · 1685-1712
DOI: 10.1007/s10114-026-5033-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Acta Mathematica Sinica, English Series, online erschienen am 15.06.2026. Verfasst von Xinxin Chen. Die Arbeit nennt 7 Literaturangaben.
Abstract (Originalsprache)
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 α, we describe the asymptotic behaviors of the population at the αN-th generation as N goes to infinity. We also study the criticality of the survival probability at the (eN−32logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(eN-\frac{3}{2}{\rm{log}}N)$$\end{document}-th generation in this paper.
Zitieren
APA
Chen, X. (2026). Increasing Paths on N-ary Trees. Acta Mathematica Sinica, English Series, 42(6), 1685-1712. https://doi.org/10.1007/s10114-026-5033-9
Vancouver
Chen X. Increasing Paths on N-ary Trees. Acta Mathematica Sinica, English Series. 2026;42(6):1685-1712. doi:10.1007/s10114-026-5033-9
BibTeX
@article{Chen2026,
author = {Chen, Xinxin},
title = {Increasing Paths on N-ary Trees},
journal = {Acta Mathematica Sinica, English Series},
year = {2026},
volume = {42},
number = {6},
pages = {1685--1712},
doi = {10.1007/s10114-026-5033-9}
}
EUVIMED