Some spin glass ideas applied to the clique problem
Antonio Iovanella, Benedetto Scoppola, Elisabetta Scoppola
Abstract
In this paper we introduce a new algorithm to study some NP-complete problems. This algorithm is a Markov Chain Monte Carlo (MCMC) inspired by the cavity method developed in the study of spin glass. We will focus on the maximum clique problem and we will compare this new algorithm with several standard algorithms on some DIMACS benchmark graphs and on random graphs. The performances of the new algorithm are quite surprising. Our effort in this paper is to be clear as well to those readers who are not in the field.
Create a lesson
Related papers
Long-time Dynamics of Many-body Open Quantum Systems using Quantum Generating Functions
Katha Ganguly, Dario Poletti, Bijay Kumar Agarwalla
Localization Delocalization Transition in Diffusion with Adaptive Resetting
Tommer D. Keidar, Shlomi Reuveni
Quenched activity induces nonuniversal scaling in nonreciprocal XY Models and surfaces
Sudip Mukherjee, Abhik Basu
Brownian yet non-Gaussian diffusion through equilibrium nonlinear friction
Jakob Mihatsch, Andreas M. Menzel
When dissipative steady states admit thermodynamic occupation laws
Tetsu Ichitsubo
Fluctuation--response relations from an emergent Z2 symmetry in the rotating stochastic Landau model
Dhruv Kush, Nicki Mullins, Mauricio Hippert et al.