Loop corrections for hard spheres in Hamming space (2409.03670v1)
Abstract: We begin with an exact expression for the entropy of a system of hard spheres within the Hamming space. This entropy relies on probability marginals, which are determined by an extended set of Belief Propagation (BP) equations. The BP probability marginals are functions of auxiliary variables which are introduced to model the effects of loopy interactions on a tree-structured interaction graph. We explore various reasonable and approximate probability distributions, ensuring they align with the exact solutions of the BP equations. Our approach is based on an ansatz of (in)homogeneous cavity marginals respecting the permutation symmetry of the problem. Through thorough analysis, we aim to minimize errors in the BP equations. Our findings support the conjecture that the maximum packing density asymptotically conforms to the lower bound proposed by Gilbert and Varshamov, further validated by the solution of the loopy BP equations.
- Zong C. Sphere packings. Springer Science & Business Media; 2008 Jan 20.
- Parisi G, Zamponi F. Mean-field theory of hard sphere glasses and jamming. Reviews of Modern Physics. 2010 Mar 16;82(1):789.
- Torquato S, Stillinger FH. Jammed hard-particle packings: From Kepler to Bernal and beyond. Reviews of modern physics. 2010 Sep 15;82(3):2633.
- Fejes L. Über einen geometrischen Satz. Mathematische Zeitschrift. 1940 Dec;46(1):83-5.
- Hales TC. A proof of the Kepler conjecture. Annals of mathematics. 2005 Nov 1:1065-185.
- Viazovska MS. The sphere packing problem in dimension 8. Annals of mathematics. 2017 May 1:991-1015.
- Ball K. A lower bound for the optimal density of lattice packings. International Mathematics Research Notices. 1992 Jan 1;1992(10):217-21.
- Delsarte P, Levenshtein VI. Association schemes and coding theory. IEEE Transactions on Information Theory. 1998 Oct;44(6):2477-504.
- Samorodnitsky A. On the optimum of Delsarte’s linear program. Journal of Combinatorial Theory, Series A. 2001 Nov 1;96(2):261-87.
- Jiang T, Vardy A. Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes. IEEE Transactions on Information Theory. 2004 Jul 26;50(8):1655-64.
- Cohn H. New upper bounds on sphere packings II. Geometry & Topology. 2002 Jun 25;6(1):329-53.
- Cohn H, Triantafillou N. Dual linear programming bounds for sphere packing via modular forms. Mathematics of Computation. 2022 Jan;91(333):491-508.
- Procacci A, Scoppola B. Statistical mechanics approach to coding theory. Journal of statistical physics. 1999 Aug;96:907-12.
- Parisi G, Slanina F. Toy model for the mean-field theory of hard-sphere liquids. Physical Review E. 2000 Nov 1;62(5):6554.
- Parisi G, Zamponi F. On the high density behavior of Hamming codes with fixed minimum distance. Journal of statistical physics. 2006 Jun;123(6):1145-67.
- Ramezanpour A, Zecchina R. Cavity approach to sphere packing in Hamming space. Physical Review E. 2012 Feb 6;85(2):021106.
- Ramezanpour A. Computing loop corrections by message passing. Physical Review E. 2013 Jun 28;87(6):060103.
- Mezard M, Parisi G. The Bethe lattice spin glass revisited. The European Physical Journal B-Condensed Matter and Complex Systems. 2001 Mar;20:217-33.