Sparse hard-disk packings and local Markov chains

DOI10.1007/s10955-022-02908-4zbMath1487.52032arXiv2109.13343OpenAlexW3202701645MaRDI QIDQ2131132

Werner Krauth, Nicolas Noirault, Philipp Höllmer, A. C. Maggs, Botao Li

Publication date: 25 April 2022

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.13343

zbMATH Keywords

stabilityMarkov chainsmixing timesBöröczky packingsevent-chain Monte Carlohard-disk modelhard-disk packings

Mathematics Subject Classification ID

Stochastic methods applied to problems in equilibrium statistical mechanics (82B31) Discrete geometry (52C99) Markov processes (60J99)

Related Items (2)

BigBoro ⋮ PDMP characterisation of event-chain Monte Carlo algorithms for particle systems

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
• A linear programming algorithm to test for jamming in hard-sphere packings
• Geometric analysis for the Metropolis algorithm on Lipschitz domains
• Analysis of a nonreversible Markov chain sampler.
• Sparse locally-jammed disk packings
• Über einen geometrischen Satz
• Lifting Markov chains to speed up mixing
• Min-Type Morse Theory for Configuration Spaces of Hard Spheres
• Cluster algorithm for hard spheres and related systems
• Forward Event-Chain Monte Carlo: Fast Sampling by Randomness Control in Irreversible Markov Chains
• Algorithms and Computation
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Sparse hard-disk packings and local Markov chains