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

固定温度下的随机优化问题

Random optimization problems at fixed temperatures

University of Illinois Urbana Champaign(伊利诺伊大学厄巴纳-香槟分校);University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校)

Partha S. Dey, Grigory Terlov

AI总结:

研究一类无序平均场组合优化问题的吉布斯测度,在一般权重分布下推导对数配分函数、典型构型权重及吉布斯平均的极限定理,并证明副本对称性。

摘要:

本文考虑一类无序平均场组合优化问题。我们关注吉布斯测度,其中逆温度不随图的大小变化,且边权重在温和假设下从一般分布中采样。我们的结果包括对数配分函数、典型构型权重以及淬火和退火形式下吉布斯平均的大数定律和中心极限定理。我们还推导了两个独立样本交集大小的淬火泊松收敛,从而得到模型的副本对称性。应用涵盖文献中的流行模型,如最小匹配问题、旅行商问题和最小生成树问题,在确定性及随机稠密图序列上,图规模递增。

英文摘要:

This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a general distribution under mild assumptions. Our results consist of the Law of Large Numbers and Central Limit Theorems for the log-partition function, the weight of a typical configuration, and the Gibbs average in both quenched and annealed forms. We also derive quenched Poisson convergence for the size of the intersection of two independent samples, yielding replica symmetry of the model. Applications cover popular models from the literature, such as the Minimal Matching Problem, Traveling Salesman Problem, and Minimal Spanning Tree Problem, on a sequence of deterministic and random dense graphs of increasing size.

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

↑