Related Experiment Video
Updated: Aug 7, 2026

Setting Limits on Supersymmetry Using Simplified Models
Published on: November 16, 2013
Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture
1Institute for Theoretical Physics, University of Göttingen, Bunsenstrasse 9, 37073 Göttingen, Germany. weigt@theorie.physik.uni-goettingen.de
Abstract:
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius 1, and they are found to be in excellent agreement with numerical simulations. We give a detailed description of the replica-symmetric phase, including the size and entropy of the minimal vertex covers, and the structure of the unfrozen component which is found to percolate at a connectivity c approximately 1.43. The replica-symmetric solution breaks down at c=e approximately 2.72. We give a simple one-step replica-symmetry-broken solution, and discuss the problems in the interpretation and generalization of this solution.
Related Concept Videos
Network Covalent Solids
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
First Law: Particles in One-dimensional Equilibrium
First Law: Particles in Two-dimensional Equilibrium
Newton's first law tells us about the...
Gauss's Law: Spherical Symmetry
Gauss's Law: Planar Symmetry

