在随机正则图中应用提升的第二矩方法
Boosted second moment method in random regular graphs
AI总结:
本文提出在随机正则图中应用提升的第二矩方法,通过改进的马尔可夫性质提升独立集下界,从而在d≥10时超越原有最佳结果。
摘要:
确定随机正则图的渐近独立比是稀疏随机图领域中的关键挑战。由于插值方法,我们已经拥有非常良好的上界,这些上界实际上已知在足够大的度数下是精确的。然而,我们仍然需要为特定度数提供良好的显式下界。\n\n经典的Frieze和Łuczak方法通过首先对稀疏Erdős--Rényi图应用第二矩方法,然后巧妙地从该模型过渡到正则图来获得下界。他们得到了一个随着度数趋于无穷时的渐近公式,但并未为特定度数推导出显式的下界。\n\n相比之下,本文直接将第二矩方法应用于随机正则图。这种方法有若干优势。首先,我们可以对任何给定的度数d数值计算良好的显式下界。此外,我们甚至可以通过论证所获得的独立集具有一定的空间马尔可夫性质来提升这个下界。然后可以利用这一性质通过局部修改独立集来实现显著改进,并在任何d≥10的情况下超越之前的最佳下界。最后,这种方法在d趋于无穷时比原始的Frieze--Łuczak方法提供了更精细的渐近结果。\n\n此外,这些结果可能在独立比之外的范围内也有用,因为具有马尔可夫性质的独立集可能用于构造随机正则图中的其他对象。为了证明这一点,我们考虑了将随机正则图分解为星图的问题。
英文摘要:
Determining the asymptotic independence ratio of random regular graphs is a key challenge in the area of sparse random graphs. Due to the interpolation method, we have very good upper bounds at our disposal, which are actually known to be sharp for sufficiently large degrees. However, we are still in need of good explicit lower bounds for specific degrees. The classical approach by Frieze and Łuczak achieves a lower bound by first applying the second moment method to sparse Erdős--Rényi graphs, and then cleverly transitioning from that model to regular graphs. They obtain an asymptotic formula (as the degree tends to infinity) but no explicit lower bounds are derived for specific degrees. In contrast, in this paper, we apply the second moment method directly to random regular graphs. This approach has a number of advantages. First, we can numerically compute good explicit lower bounds for any given degree $d$. Moreover, we can even boost this lower bound by arguing that the obtained independent set has a certain spatial Markov property. One can then exploit this property by making local modifications to the independent set, resulting in substantial improvements, and beating the previous best bounds for any $d \geq 10$. Finally, this method gives finer asymptotics as $d \to \infty$ than the original Frieze--Łuczak approach. Moreover, these results can be useful even beyond the scope of the independence ratio due to the fact that independent sets with the Markov property may be used to construct other objects in random regular graphs. To demonstrate this, we consider the problem of decomposing random regular graphs into stars.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。