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

Journal of Physics A: Mathematical and General

Volumn 35, Issue 33, 2002, Pages 6973-6983

  Angles d'Auriac J Ch ^a   Igloi F ^b,c   Preissmann, M ^d   Sebo, A ^d  

^a CNRS   (France)

^b WIGNER RESEARCH CENTRE FOR PHYSICS   (Hungary)

^c UNIVERSITY OF SZEGED   (Hungary)

^d Laboratoire LEIBNIZ CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041381202     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/35/33/301     Document Type: Article

References (29)

1. Yeomans J M 1992 Statistical Mechanics of Phase Transitions (Oxford: Clarendon)
2. Baxter R J 1982 Exactly Solved Models in Statistical Mechanics (New York: Academic)
3. Barahona F, Maynard R, Rammal R and Uhry J P 1982 Morphology of ground states of a two-dimensional frustration model J. Phys. A: Math. Gen. 15 673-9
4. Bieche I, Maynard R, Rammal R and Uhry J P 1980 On the ground states of the frustration model of a spin glass by a matching method of graph theory J. Phys. A: Math. Gen. 13 2553-76
5. Anglès d'Auriac J C and Maynard R 1984 On the random antiphase state in the ±spin glass model in two dimensions Solid State Commun. 49 785
6. Galluccio A, Loebl M and Vondrák J 2000 New algorithm for the Ising problem: partition function for finite lattice graphs Phys. Rev. Lett. 84 5924-7
7. Anglès d'Auriac J C, Preissmann M and Rammal R 1985 The random field Ising model: algorithmic complexity and phase transition J. Phys. Lett. 46 173
8. Anglès d'Auriac J C and Sourlas N 1997 The 3-d random field Ising model at zero temperature Europhys. Lett. 39 473
9. Anglès d'Auriac J C, Preissmann M and Sebo A 1997 Optimal cuts in graphs and statistical mechanics J. Math. Comput. Modelling 26 1
10. Alava M J, Duxbury P M, Moukarzel C F and Rieger H 2001 Exact combinatorial algorithms: ground states of disordered systems Phase Transitions and Critical Phenomena vol 18 ed C Domb and J L Lebowitz (London: Academic) p 143
11. Juhász R, Rieger H and Iglói F 2001 Random bond Potts model in the large-q limit Phys. Rev. E 64 56122
12. Grötschel M, Lovász L and Schrijver A 1988 Geometric Algorithms and Combinatorial Optimization (Berlin: Springer)
13. Schrijver A 2000 A combinatorial algorithm minimizing submodular functions in strongly polynomial time J. Comb. Theory B 80 346-55
14. Iwata S, Fleischer L and Fujishige S 2001 A combinatorial strongly polynomial algorithm for minimizing submodular functions J. ACM 48 761-77
15. Iwata S 2002 A fully combinatorial algorithm for submodular function minimization J. Comb. Theory B 84 203-12
16. Frank A and Tardos É 1988 Generalized polymatroids and submodular flows Math. Program. 42 489-563
17. Cunningham W H 1985 Optimal attack and reinforcement of a network J. ACM 32 549-61
18. Barahona F 1992 Separating from the dominant of the spanning tree polytope Oper. Res. Lett. 12 201-3
19. Baïou M, Barahona F and Mahjoub A R 2000 Separation of partition inequalities Math. Oper. Res. 25 243-54
20. Iglói F, Preissmann M and Sebo A 2002 Optimal Cooperation (Cahiers du laboratoire Leibniz)
21. Wu F Y 1982 The Potts model Rev. Mod. Phys. 54 235
22. Kasteleyn P W and Fortuin C M 1969 J. Phys. Soc. Japan 26
23. Lovász L 1979 Combinatorial Problems and Exercises (North Holland and Akadmiai Kiadó)
24. Picard J-C and Queyranne M 1982 Selected applications of minimum cuts in networks INFOR 20 394-422
25. Padberg M W and Wolsey L A 1983 Trees and cuts Ann. Discrete Math. 17 511-7
26. Ford L R and Fulkerson D R 1956 Maximum flow through a network Can. J. Math. 8 399-404
27. Ahuja R K, Magnanti T L and Orlin J B 1993 Network Flows: Theory, Algorithms and Applications (Englewood Cliffs, NJ: Prenctice-Hall)
28. Goldberg A V and Tarjan R E 1988 A new approach to the maximum-flow problem J. Ass. Comput. Mach. 35 921-40
29. Anglès d'Auriac J C, Iglói F, Preissmann M and Sebo A unpublished