Vezzani, Alessandro and Cassi, Davide and Burioni, Raffaella - Average properties of combinatorial problems and thermodynamics of spin models on graphs

dmtcs:3329 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Average properties of combinatorial problems and thermodynamics of spin models on graphs

Authors: Vezzani, Alessandro and Cassi, Davide and Burioni, Raffaella

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.


Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Submitted on: May 10, 2017
Keywords: statistical mechanics,graphs,random-walks,percolation,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]


Share

Consultation statistics

This page has been seen 70 times.
This article's PDF has been downloaded 67 times.