arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0906.0152math.PR
收藏

均匀随机递归dag中的长路和短路

Long and short paths in uniform random recursive dags

Luc Devroye, Svante Janson

摘要:

在均匀随机递归k-dag中,有一个根0,每个节点依次从1到n从索引较小的节点中选择k个均匀随机父节点。若S_n是从结点n到根的最短路径距离,则我们确定常数σ,使得当n趋于无穷大时,S_n/log(n)有概率趋于σ。我们还证明了max_{1 \le i \le n} S_i/log(n)在概率上趋于σ。

英文摘要:

In a uniform random recursive k-dag, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If S_n is the shortest path distance from node n to the root, then we determine the constant σsuch that S_n/log(n) tends to σin probability as n tends to infinity. We also show that max_{1 \le i \le n} S_i/log(n) tends to σin probability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑