The hard-core model on random graphs revisited


We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random graphs with small and very large average degrees respectively are quite well understood, they yield qualitatively different… (More)
DOI: 10.1088/1742-6596/473/1/012021

3 Figures and Tables


  • Presentations referencing similar topics