.png){kind=icon}
.png){kind=icon}
Return
Uniform Temporal Trees
.png){kind=icon}
OA
AI
DOI：10.1002/rsa.70040.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 T-n,T-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 T-n,T-p which states that divided by T-n,T-p divided by/e(np) converges in distribution to an Exponential(1) random variable as n ->infinity. For the height H-n,H-p, we prove that H-n,H-p/np converges to e in probability. Uniform temporal trees show some remarkable similarities to uniform random recursive trees.
Keywords:
random temporal trees
random trees
temporal graphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
R
IF:
0
Papers:
29
Citations:
0