Birthday不等式、斥力和硬球
Birthday Inequalities, Repulsion, and Hard Spheres
摘要:
本文研究了随机几何图中的一个生日不等式:空图的概率上界为每条边不存在的概率的乘积。我们发现生日不等式在低密度下成立,但在一般情况下不成立。给出了birthday不等式在统计物理和组合数学中的三种不同应用:证明了硬球模型自由能的下界和d-正则图中给定大小的独立集和匹配个数的上界。生日不等式是由一个排斥不等式所隐含的:如果我们以中心的成对距离大于r为条件,那么围绕n个随机放置的中心的半径为r的球体的并集的期望体积会增加。令人惊讶的是,我们表明,排斥不等式是不正确的,在一般情况下,特别是它失败在24维欧几里得空间:条件对24维球体的中心的两两相斥可以减少其工会的预期体积。
英文摘要:
We study a birthday inequality in random geometric graphs: the probability of the empty graph is upper bounded by the product of the probabilities that each edge is absent. We show the birthday inequality holds at low densities, but does not hold in general. We give three different applications of the birthday inequality in statistical physics and combinatorics: we prove lower bounds on the free energy of the hard sphere model and upper bounds on the number of independent sets and matchings of a given size in d-regular graphs. The birthday inequality is implied by a repulsion inequality: the expected volume of the union of spheres of radius r around n randomly placed centers increases if we condition on the event that the centers are at pairwise distance greater than r. Surprisingly we show that the repulsion inequality is not true in general, and in particular that it fails in 24-dimensional Euclidean space: conditioning on the pairwise repulsion of centers of 24-dimensional spheres can decrease the expected volume of their union.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。