Optimal Cooperation and Submodularity for Computing Potts' Partition Functions with a Large Number of State
Statistical Mechanics
2007-05-23 v1
Abstract
The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature expansion. Computing this dominant diagram amounts to minimizing a particular submodular function. We provide a combinatorial optimization algorithm, the optimal cooperation algorithm, which works in polynomial time for any lattice. Practical implementation and the speed of the method is also discussed.
Cite
@article{arxiv.cond-mat/0204055,
title = {Optimal Cooperation and Submodularity for Computing Potts' Partition Functions with a Large Number of State},
author = {J-Ch. Angles d'Auriac and F. Igloi and M. Preissmann and A. Sebo},
journal= {arXiv preprint arXiv:cond-mat/0204055},
year = {2007}
}
Comments
18 pages, no figure