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

通过局部极限的贪心极大独立集

Greedy maximal independent sets via local limits

Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman

AI总结:

本文提出基于局部收敛的通用框架,用于计算图序列上随机贪心极大独立集的渐近密度,并将其应用于已有及新型随机图族。

摘要:

用于在图中寻找极大独立集的随机贪心算法,通过以随机顺序检查图的顶点来构造极大独立集:如果当前顶点不与任何先前加入的顶点相邻,就将其加入独立集。在本文中,我们利用局部收敛的概念,提出了一个通用框架,用于计算(可能是随机的)图序列上随机贪心独立集的渐近密度。我们使用该框架对以往研究过的图族(如路径和二项随机图)的结果给出了直接证明,并研究了新的图族,如随机树和稀疏随机平面图。最后,我们更细致地分析了当基础图为树时的随机贪心算法。

英文摘要:

The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent to any previously added vertex. In this paper, we present a general framework for computing the asymptotic density of the random greedy independent set for sequences of (possibly random) graphs by employing a notion of local convergence. We use this framework to give straightforward proofs for results on previously studied families of graphs, like paths and binomial random graphs, and to study new ones, like random trees and sparse random planar graphs. We conclude by analysing the random greedy algorithm more closely when the base graph is a tree.

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

↑