一类双边协议随机图的连通性
Connectivity of a Family of Bilateral Agreement Random Graphs
AI总结:
针对La和Kabkab提出的双边协议随机图,我们证明了其连通性猜想(k(t)=t log n时t>1连通、t<1不连通),并给出平均度渐近表达式,解决了该图族连通性未被正式分析的问题。
摘要:
La和Kabkab于2015年引入并分析了基于双边协议的随机无向图。该模型中n个顶点的图构建方式为:每个顶点对其他n-1个顶点有(随机)偏好顺序,仅偏好自身顺序中前k个顶点(k通常为n的函数);当且仅当潜在边的两个顶点相互偏好时,边才会形成。这种随机图是Cooper和Frieze的随机k近邻图的推广,后者仅考虑顶点的单边偏好。Moharrami等人研究了k有限时该随机图族在n趋于无穷时巨连通分支的出现及其大小,但该族的连通性尚未被正式分析。La和Kabkab在其原始论文中猜想,当k(t)=t log n时,高概率下t>1时图连通,t<1时图不连通,我们为此猜想提供了证明,并给出了该图平均度的渐近表达式。
英文摘要:
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex only prefers the top $k$ other vertices using its own preference order; in general, $k$ can be a function of $n$. An edge is constructed in the ensuing graph if and only if both vertices of a potential edge prefer each other. This random graph is a generalization of the random $k^{th}$-nearest neighbor graphs of Cooper and Frieze that only consider unilateral preferences of the vertices. Moharrami \emph{et al.} studied the emergence of a giant component and its size in this new random graph family in the limit of $n$ going to infinity when $k$ is finite. Connectivity properties of this random graph family have not yet been formally analyzed. In their original paper, La and Kabkab conjectured that for $k(t)=t \log n$, with high probability connectivity happens at $t>1$ and the graph is disconnected for $t<1$. We provide a proof for this conjecture. We will also introduce an asymptotic for the average degree of this graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。