2025/01/22 by Caelan Atamanchuk, Luc Devroye, Atamanchuk, Caelan +3 · 2 citations
Computer Science · #Cellular Automata and Applications #FOS: Mathematics #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2501.13044
openalex publication_date 2025/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin uniform temporal trees. A uniform temporal tree is obtained by assigning independent uniform [0,1] labels to the edges of a rooted complete infinite n-ary tree and keeping only those vertices for which the path from the root to the vertex has decreasing edge labels. The p-percolated uniform temporal tree, denoted by Tn,p, is obtained similarly, with the additional constraint that the edge labels on each path are all below p. We study several properties of these trees, including their size, height, the typical depth of a vertex, and degree distribution. In particular, we establish a limit law for the size of Tn,p which states that \frac|Tn,p|enp converges in distribution to an \exponential(1) random variable as n → ∞. For the height Hn,p, we prove that \fracHn,pnp converges to e in probability. Uniform temporal trees show some remarkable similarities to uniform random recursive trees.