A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings

Résumé

Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of planar graphs. We illustrate it by computing the Potts model partition functions and chromatic polynomials (the number of proper vertex colourings using Q colours) for large samples of random planar graphs with up to N=100 vertices. In the latter case, our algorithm yields a sub-exponential average running time of ~ exp(1.516 sqrt(N)), a substantial improvement over the exponential running time ~ exp(0.245 N) provided by the hitherto best known algorithm. We study the statistics of chromatic roots of random planar graphs in some detail, comparing the findings with results for finite pieces of a regular lattice.
Fichier principal
Vignette du fichier
tree_transfer_v8.pdf (528.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00466411 , version 1 (23-03-2010)
hal-00466411 , version 2 (28-05-2010)
hal-00466411 , version 3 (06-08-2010)

Identifiants

Citer

Andrea Bedini, Jesper Jacobsen. A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings. 2010. ⟨hal-00466411v3⟩
132 Consultations
272 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More