Gibbs measures and dismantlable graphs
From MaRDI portal
Publication:1569061
DOI10.1006/jctb.1999.1935zbMath1030.05101OpenAlexW2028609790MaRDI QIDQ1569061
Graham R. Brightwell, Peter M. Winkler
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b0d452484bf96ad7862628870782dd1179535234
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Classical equilibrium statistical mechanics (general) (82B05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Structural characterization of families of graphs (05C75)
Related Items
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree, Counting and sampling \(H\)-colourings, The topological strong spatial mixing property and new conditions for pressure approximation, Hom complexes and homotopy in the category of graphs, Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings, The structure of bi-arc trees, Generalisation of the Hammersley-Clifford theorem on bipartite graphs, PTAS for Sparse General-valued CSPs, Capturing the drunk robber on a graph, Mixing is hard for triangle-free reflexive graphs, Minimal graphs for contractible and dismantlable properties, Recolouring homomorphisms to triangle-free reflexive graphs, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, The impact of loops on the game of cops and robbers on graphs, Information flow on trees, Dismantlability, connectedness, and mixing in relational structures, Four-cycle free graphs, height functions, the pivot property and entropy minimality, The role of information in the cop-robber game, An annotated bibliography on guaranteed graph searching, Markov random fields, Markov cocycles and the 3-colored chessboard, Fundamental Groupoids for Graphs, Reconfiguring graph homomorphisms on the sphere, Strong spatial mixing in homomorphism spaces, Fully Active Cops and Robbers, Unnamed Item, A survey on the relationship between the game of cops and robbers and other game representations, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, A homotopy category for graphs, Hom complexes and homotopy theory in the category of graphs, Dismantlability, Connectedness, and Mixing in Relational Structures, Mixing properties of colourings of the ℤd lattice, Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$, A variational principle for a non-integrable model, Finitary codings for spatial mixing Markov random fields, On a contraction-like property of dismantlable graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The core of a graph
- Gibbs measures and phase transitions
- Percolation and the hard-core lattice gas model
- Graph homomorphisms and phase transitions
- A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
- Vertex-to-vertex pursuit in a graph
- A Helly theorem for geodesic convexity in strongly dismantlable graphs
