Optimal Cooperation and Submodularity for Computing Potts' Partition Functions with a Large Number of State

Simple item page
dc.creatord'Auriac, J-Ch. Angles
dc.creatorIgloi, F.
dc.creatorPreissmann, M.
dc.creatorSebo, A.
dc.date2002-04-02
dc.date.accessioned2026-07-07T02:44:53Z
dc.date.available2026-07-07T02:44:53Z
dc.descriptionThe 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.
dc.description18 pages, no figure
dc.identifierhttps://arxiv.org/abs/cond-mat/0204055
dc.identifierhttp://arxiv.org/abs/cond-mat/0204055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19112
dc.subjectStatistical Mechanics
dc.titleOptimal Cooperation and Submodularity for Computing Potts' Partition Functions with a Large Number of State
dc.typetext

Files

Collections

arXiv