基于最优化方法的Hard Disk模型临界密度的下界
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics
摘要:
我们证明了硬盘模型的临界密度$ρ_c$的一个新的下界,即,在该密度以下,可以有效地对单位环面中的$n$非重叠盘的随机配置进行采样。我们使用一个经典的马尔可夫链移动一个磁盘的时间,但与改进的路径耦合分析。我们的主要工具是对相邻配置对的优化度量,即,不同的配置在一个单一的磁盘的位置:我们定义了一个度量,取决于这些位置的差异,并不断接近零,因为他们一致。这将先前的下限$ρ_c \ge 1/8$改进为$ρ_c \ge 0.154$。
英文摘要:
We prove a new lower bound on the critical density $ρ_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic Markov chain which moves one disk at a time, but with an improved path coupling analysis. Our main tool is an optimized metric on neighboring pairs of configurations, i.e., configurations that differ in the position of a single disk: we define a metric that depends on the difference in these positions, and which approaches zero continuously as they coincide. This improves the previous lower bound $ρ_c \ge 1/8$ to $ρ_c \ge 0.154$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。