arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0605414math.PRmath.CO
收藏

有限方差随机图中距离的普适性:扩展版本

Universality for the distance in finite variance random graphs: Extended version

Henri van den Esker, Remco van der Hofstad, Gerard Hooghiemstra

摘要:

我们推广的配置模型中的两个一致选择的节点之间的图的距离的渐近行为,以广泛的一类随机图。这类图包括Poissonian随机图、期望度随机图和广义随机图(包括经典的Erdos-Renyi图)。在本文中,我们分配给每个节点的确定性的能力和概率,存在一对节点之间的边缘是等于一个功能的产品的能力对除以所有节点的总容量。我们考虑的能力是这样的一个节点的程度一致有界的时刻,严格大于2,以便,特别是,度有有限的方差。我们证明了图的距离像\log_ν N一样增长,其中ν依赖于容量。此外,在这个渐近平均值\log_ν N的随机波动被证明是紧的。我们还考虑了容量是正随机Λ的独立副本的情况,其中\prob{Λ> x} \leq cx^{1-τ},对于某个常数c和τ>3,再次得到度具有有限方差的图。这些结果的证明方法是耦合类的每个成员的泊松随机图,然后我们给出了完整的证明,通过调整配置模型的相应结果的参数。

英文摘要:

We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree random graph and the generalized random graph (including the classical Erdos-Renyi graph). In the paper we assign to each node a deterministic capacity and the probability that there exists an edge between a pair of nodes is equal to a function of the product of the capacities of the pair divided by the total capacity of all the nodes. We consider capacities which are such that the degrees of a node has uniformly bounded moments of order strictly larger than two, so that, in particular, the degrees have finite variance. We prove that the graph distance grows like \log_νN, where the νdepends on the capacities. In addition, the random fluctuations around this asymptotic mean \log_νN are shown to be tight. We also consider the case where the capacities are independent copies of a positive random Λwith \prob{Λ> x}\leq cx^{1-τ}, for some constant c and τ>3, again resulting in graphs where the degrees have finite variance. The method of proof of these results is to couple each member of the class to the Poissonian random graph, for which we then give the complete proof by adapting the arguments of the corresponding result for the configuration model.

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

↑