Physics – Mathematical Physics
Scientific paper
2005-01-03
Physics
Mathematical Physics
In this new version the introduction has been revised, some references have been added, and many typos have been corrected. 37
Scientific paper
In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$, to a much wider class of infinite graphs. In particular, concerning the subcritical regime, we show that the connectivity functions are analytic and decay exponentially in any bounded degree graph. In the supercritical phase, we are able to prove the analyticity of finite connectivity functions in a smaller class of graphs, namely, bounded degree graphs with the so called minimal cut-set property and satisfying a (very mild) isoperimetric inequality. On the other hand we show that the large distances decay of finite connectivity in the supercritical regime can be polynomially slow depending on the topological structure of the graph. Analogous analyticity results are obtained for the pressure of the Random Cluster Model on an infinite graph, but with the further assumptions of amenability and quasi-transitivity of the graph.
Procacci Aldo
Scoppola Benedetto
No associations
LandOfFree
Convergent expansions for Random Cluster Model with q>0 on infinite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Convergent expansions for Random Cluster Model with q>0 on infinite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergent expansions for Random Cluster Model with q>0 on infinite graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-282759