Recurrent random walks and the absence of continuous symmetry breaking on graphs

1994 ◽  
Vol 75 (1-2) ◽  
pp. 153-165 ◽  
Author(s):  
Franz Merkl ◽  
Herbert Wagner
1976 ◽  
Vol 36 (14) ◽  
pp. 804-806 ◽  
Author(s):  
J. Fröhlich ◽  
B. Simon ◽  
T. Spencer

2015 ◽  
Vol 23 (15) ◽  
pp. 19261 ◽  
Author(s):  
Luciano Socci ◽  
Vito Sorianello ◽  
Marco Romagnoli

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Alessandro Vezzani ◽  
Davide Cassi ◽  
Raffaella Burioni

International audience 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.


1995 ◽  
Vol 52 (4) ◽  
pp. 4516-4519 ◽  
Author(s):  
P. Alpatov ◽  
L. E. Reichl

Sign in / Sign up

Export Citation Format

Share Document