Library Header Image
LSE Research Online LSE Library Services

Graph homomorphisms and phase transitions

Brightwell, Graham and Winkler, P. (1999) Graph homomorphisms and phase transitions. Journal of Combinatorial Theory, Series B, 77 (2). pp. 221-262. ISSN 0095-8956

Full text not available from this repository.
Identification Number: 10.1006/jctb.1999.1899


We model physical systems with “hard constraints” by the space Hom(G, H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H. For any assignment λ of positive real activities to the nodes of H, there is at least one Gibbs measure on Hom(G, H); when G is infinite, there may be more than one. When G is a regular tree, the simple, invariant Gibbs measures on Hom(G, H) correspond to node-weighted branching random walks on H. We show that such walks exist for every H and λ, and characterize those H which, by admitting more than one such construction, exhibit phase transition behavior.

Item Type: Article
Official URL:
Additional Information: © 1999 Academic Press
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 17 Feb 2010 12:51
Last Modified: 20 Jul 2024 22:36

Actions (login required)

View Item View Item