随机超图上的最小顶点覆盖问题:副本对称解和一个去叶算法
Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm
摘要:
利用随机系统统计力学中的副本方法和叶移除算法研究了随机α-一致超图的最小顶点覆盖问题.发现在临界平均度e/(α-1)处存在一个相变。在临界度以下,复型对称分析法的解与复型对称分析法的解是一致的。相反,在临界度以上,副本对称解变得不稳定,这些方法无法估计精确解,这些结果强烈地表明副本对称性与近似算法的性能之间有着密切的关系。
英文摘要:
We study minimum vertex cover problems on random α-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase transition at the critical average degree e/(α-1). Below the critical degree, a replica symmetric ansatz in the statistical-mechanical method holdsand the algorithm estimates a solution of the problem which coincide with that by the replica method. In contrast, above the critical degree, the replica symmetric solution becomes unstable and these methods fail to estimate the exact solution.These results strongly suggest a close relation between the replica symmetry and the performance of approximation algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。