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

随机图中反馈弧集问题的渐近下界

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs

West Virginia University(西弗吉尼亚大学);Boston University(波士顿大学);Howard University(霍华德大学)

Harvey Diamond, Mark Kon, Louise Raphael

AI总结:

该研究在随机图中确定了反馈弧集问题的渐近下界,并展示了近似值与实验数据的一致性。

摘要:

给定一个有向图,最小反馈弧集(FAS)问题要求找到一个最小的弧集,当这些弧被移除后,图将变成无环图。在一篇开创性论文中,Berger和Shor[1]于1990年在一般有向图中开发了FAS问题的初始上界。本文在由Erdős-Rényi模型G(n,M)导出的一类随机有向图中,研究了FAS问题的渐近下界。该模型包含n个顶点和M条无向边,后者随机选择。然后每条边被随机赋予方向以形成我们的有向图。我们证明了Pr(Y* ≤ M(1/2 -√(log n/Δ_av)))以指数形式趋近于零,其中Y*是(随机的)最小反馈弧集的大小,Δ_av=2M/n是平均顶点度。对于随机比赛(特例)的下界由Spencer[12]和de la Vega[13]获得,并进行了讨论。在将上述界限与K.Hanauer[7]在相关随机图上开发的平均实验FAS数据进行比较时,我们发现近似Y*_{av} ≈ M(1/2 -1/2√(log n/Δ_av))在图形上与算法计算的平均大小Y*_{av}惊人地接近。

英文摘要:

Given a directed graph, the Minimum Feedback Arc Set (FAS) problem asks for a minimum (size) set of arcs in a directed graph, which, when removed, results in an acyclic graph. In a seminal paper, Berger and Shor [1], in 1990, developed initial upper bounds for the FAS problem in general directed graphs. Here we find asymptotic \textit{lower bounds} for the FAS problem in a class of random, oriented, directed graphs derived from the Erdős-Rényi model $G(n,M)$, with n vertices and M (undirected) edges, the latter randomly chosen. Each edge is then randomly given a direction to form our directed graph. We show that $$Pr\left(\textbf{Y}^* \le M \left( \frac{1}{2} -\sqrt{\frac{\log n}{Δ_{av}}}\right)\right)$$ approaches zero exponentially in $n$, with $\textbf{Y}^*$ the (random) size of the minimum feedback arc set and $Δ_{av}=2M/n$ the average vertex degree. Lower bounds for random tournaments, a special case, were obtained by Spencer [12] and de la Vega [13] and these are discussed. In comparing the bound above to averaged experimental FAS data on related random graphs developed by K. Hanauer [7] we find that the approximation $\textbf{Y}^*_{av} \approx M\left( \frac{1}{2} -\frac{1}{2}\sqrt{\frac{\log n}{Δ_{av}}}\right)$ lies remarkably close graphically to the algorithmically computed average size $\textbf{Y}^*_{av}$ of minimum feedback arc sets.

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

↑