Skip to Main content Skip to Navigation
Conference papers

Average properties of combinatorial problems and thermodynamics of spin models on graphs

Abstract : The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average. Indeed, spinmodels with O(n) continuous symmetry present spontaneous magnetization only on transient on the average graphs, while models with discrete symmetry (Ising and Potts) are spontaneously magnetized on graphs exhibiting percolation on the average. In this paper we define the combinatorial problems on the average, showing that they give rise to classifications of graph topology which are different from the ones obtained in usual (local) random-walks and percolation. Furthermore, we illustrate the theorem proving the correspondence between Potts model and average percolation.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183924
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 9:06:52 AM
Last modification on : Wednesday, April 17, 2019 - 2:34:02 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:37:21 AM

File

dmAC0131.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01183924, version 1

Collections

Citation

Alessandro Vezzani, Davide Cassi, Raffaella Burioni. Average properties of combinatorial problems and thermodynamics of spin models on graphs. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.333-344. ⟨hal-01183924⟩

Share

Metrics

Record views

74

Files downloads

756