Related Experiment Video
Updated: Feb 8, 2026

A Non-random Mouse Model for Pharmacological Reactivation of Mecp2 on the Inactive X Chromosome
Published on: May 22, 2019
Approximate ground states of the random-field Potts model from graph cuts
Manoj Kumar1,2, Ravinder Kumar3,4,5, Martin Weigel3
1School of Physical Sciences, Jawaharlal Nehru University, New Delhi 110067, India.
Abstract:
While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analog random-field Potts model corresponds to a multiterminal flow problem that is known to be NP-hard. Hence an efficient exact algorithm is very unlikely to exist. As we show here, it is nevertheless possible to use an embedding of binary degrees of freedom into the Potts spins in combination with graph-cut methods to solve the corresponding ground-state problem approximately in polynomial time. We benchmark this heuristic algorithm using a set of quasiexact ground states found for small systems from long parallel tempering runs. For a not-too-large number q of Potts states, the method based on graph cuts finds the same solutions in a fraction of the time. We employ the new technique to analyze the breakup length of the random-field Potts model in two dimensions.
Related Concept Videos
Approximate Integration
Linearization and Approximation
Accuracy, limits, and approximation
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...
Application of Linearization and Approximation
Ogive Graph
Graphing Antiderivatives

