arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.09155cs.DMmath.CO
收藏

一般超图上最大基数匹配的临界阈值

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs

Christopher Sumnicht, Jamison W. Weber, Dhanush R. Giriyan, Arunabha Sen

AI总结:

本文将 Erdös-Rényi 模型推广至一般超图,刻画最大基数匹配在不同超边数区间的临界阈值,并通过模拟填补中间尺度空白。

摘要:

已有大量研究利用 Erdös-Rényi 模型计算各种 NP 完全问题的“平均”最优解值,以确立临界阈值。临界阈值为问题实例的最优解定义狭窄界限,使得当实例规模趋于无穷时,解值落在这些界限之外的概率趋于零。本文将 Erdös-Rényi 模型扩展到具有 n 个顶点和 M 条超边的一般超图。我们研究确定最大基数匹配的临界阈值问题,并证明当 M=o(1.155^n) 时,最大基数匹配的大小几乎必然为 1。另一方面,如果 M=Θ(2^n),则对于任意 γ>0,最大基数匹配的大小为 Ω(n^{1/2−γ})。最后,我们通过计算机模拟,以经验方式处理 Ω(1.155^n)=M=o(2^n) 这一空白区间。

英文摘要:

Significant work has been done on computing the ``average'' optimal solution value for various $\mathsf{NP}$-complete problems using the Erdös-Rényi model to establish \emph{critical thresholds}. Critical thresholds define narrow bounds for the optimal solution of a problem instance such that the probability that the solution value lies outside these bounds vanishes as the instance size approaches infinity. In this paper, we extend the Erdös-Rényi model to general hypergraphs on $n$ vertices and $M$ hyperedges. We consider the problem of determining critical thresholds for the largest cardinality matching, and we show that for $M=o(1.155^n)$ the size of the maximum cardinality matching is almost surely 1. On the other hand, if $M=Θ(2^n)$ then the size of the maximum cardinality matching is $Ω(n^{\frac12-γ})$ for an arbitrary $γ>0$. Lastly, we address the gap where $Ω(1.155^n)=M=o(2^n)$ empirically through computer simulations.

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

↑