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

关于随机图的散布

On the spread of random graphs

Louigi Addario-Berry, Svante Janson, Colin McDiarmid

摘要:

一个连通图G的扩展度是由Alon,Boppana和Spencer(1998)提出的,用来度量图的连通程度。它定义为当X在V(G)上均匀分布时,f(X)的方差在V(G)上的所有Lipschitz函数f上的最大值.我们研究了稀疏随机图的某些模型的扩散,特别是随机正则图G(n,d),超临界范围p>1/n的Erdens-Rényi随机图G_{n,p},以及“小世界”模型.对于超临界G_{n,p},我们证明了,如果p=c/n与c>1固定,那么有很高的概率的巨组件的蔓延是有界的,我们证明了相应的声明,为其他模型的随机图,包括随机边长的模型。当p=(1+o(1))/n时,我们也给出了几乎超临界情形下的扩散的下界.进一步,我们证明了当d大时,G(n,d)的扩展很可能任意地接近于完全图K_n的扩展.

英文摘要:

The spread of a connected graph G was introduced by Alon, Boppana and Spencer (1998) and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distributed on V(G). We investigate the spread for certain models of sparse random graph; in particular for random regular graphs G(n,d), for Erdős-Rényi random graphs G_{n,p} in the supercritical range p>1/n, and for a 'small world' model. For supercritical G_{n,p}, we show that if p=c/n with c>1 fixed then with high probability the spread of the giant component is bounded, and we prove corresponding statements for other models of random graphs, including a model with random edge-lengths. We also give lower bounds on the spread for the barely supercritical case when p=(1+o(1))/n. Further, we show that for d large, with high probability the spread of G(n,d) becomes arbitrarily close to that of the complete graph K_n.

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

↑