arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.06359math.PR
收藏

超递归树的包容轮廓

The containment profile of hyperrecursive trees

Joshua Sparks, Srinivasan Balaji, Hosam Mahmoud

摘要:

我们研究了一个随机超图的顶点层次的包容性的递归树的精神。我们考虑一个本地配置文件跟踪的演化的一个特定的顶点的包容随着时间的推移,和一个全球性的配置文件关注的一个特定的包容水平的顶点的数量的计数。对于局部包容轮廓,我们得到了精确的平均值,方差和概率分布的标准组合量,如广义调和数和斯特林数的第一类。渐近地,我们观察阶段:早期的顶点有一个渐近正态分布,中间的顶点有一个泊松分布,和后期的顶点有一个退化分布。对于全局包容轮廓,我们建立了最小包容水平顶点数的渐近正态分布以及它们与次小包容水平顶点数的协方差和这些顶点数的方差。

英文摘要:

We investigate vertex levels of containment in a random hypergraph grown in the spirit of a recursive tree. We consider a local profile tracking the evolution of the containment of a particular vertex over time, and a global profile concerned about counts of the number of vertices of a particular containment level. For the local containment profile, we obtain the exact mean, variance and probability distribution in terms of standard combinatorial quantities like generalized harmonic numbers and Stirling numbers of the first kind. Asymptotically, we observe phases: the early vertices have an asymptotically normal distribution, intermediate vertices have a Poisson distribution, and late vertices have a degenerate distribution. As for the global containment profile, we establish an asymptotically normal distribution for the number of vertices at the smallest containment level as well as their covariances with the number of vertices at the second smallest containment level and the variances of these numbers.

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

↑