Optimal cooperation and submodularity for computing Potts' partition functions with a large number of states

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. The implementation of the method and its running time are also discussed.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  C. Thompson.  The Statistical Mechanics of Phase Transitions , 1978 .

[3]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[4]  L. Bieche,et al.  On the ground states of the frustration model of a spin glass by a matching method of graph theory , 1980 .

[5]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[6]  F. Y. Wu.  The Potts model , 1982 .

[7]  F. Barahona,et al.  Morphology of ground states of two-dimensional frustration model , 1982 .

[8]  J. Picard,et al.  Selected Applications of Minimum Cuts in Networks , 1982 .

[9]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .

[10]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

[11]  J. A. d'Auriac,et al.  On the random antiphase state in the ± J spin glass model in two dimensions , 1984 .

[12]  E. Mendez,et al.  Electric field induced decrease of photoluminescence lifetime in GaAs quantum wells , 1985 .

[13]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[14]  J. A. d'Auriac,et al.  The random field Ising model : algorithmic complexity and phase transition , 1985 .

[15]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[16]  András Frank,et al.  Generalized polymatroids and submodular flows , 1988, Math. Program..

[17]  Francisco Barahona,et al.  Separating from the dominant of the spanning tree polytope , 1992, Oper. Res. Lett..

[18]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[19]  N. Sourlas,et al.  The 3d random field Ising model at zero temperature , 1997 .

[20]  Myriam Preissmann,et al.  Optimal cuts in graphs and statistical mechanics , 1997 .

[21]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[22]  J. Vondrák,et al.  New algorithm for the Ising problem: partition function for finite lattice graphs. , 2000, Physical review letters.

[23]  Ali Ridha Mahjoub,et al.  Separation of Partition Inequalities , 2000, Math. Oper. Res..

[24]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[25]  H. Rieger,et al.  Exact combinatorial algorithms: Ground states of disordered systems , 2001 .

[26]  H Rieger,et al.  Random-bond Potts model in the large-q limit. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.