The multistate hard core model on a regular tree
From MaRDI portal
Graph theory (05C99) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Stochastic network models in operations research (90B15)
Abstract: The classical hard core model from statistical physics, with activity and capacity , on a graph , concerns a probability measure on the set of independent sets of , with the measure of each independent set being proportional to . Ramanan et al. proposed a generalization of the hard core model as an idealized model of multicasting in communication networks. In this generalization, the {em multi-state} hard core model, the capacity is allowed to be a positive integer, and a configuration in the model is an assignment of states from to (the set of nodes of ) subject to the constraint that the states of adjacent nodes may not sum to more than . The activity associated to state is , so that the probability of a configuration is proportional to . In this work, we consider this generalization when is an infinite rooted -ary tree and prove rigorously some of the conjectures made by Ramanan et al. In particular, we show that the model exhibits a (first-order) phase transition at a larger value of than the model exhibits its (second-order) phase transition. In addition, for large we identify a short interval of values for above which the model exhibits phase co-existence and below which there is phase uniqueness. For odd , this transition occurs in the region of , while for even , it occurs around . In the latter case, the transition is first-order.
Recommendations
- On Phase Transition in the Hard-Core Model on ${\mathbb Z}^d$
- On four state hard core models on the Cayley tree
- Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
- A \(p\)-adic hard-core model with three states on a Cayley tree
- A hard-core model on a Cayley tree: an example of a loss network
Cited in
(15)- Uniqueness of Gibbs measures for continuous hardcore models
- \(H\)-colouring bipartite graphs
- Gibbs measures on Cayley trees: results and open problems
- Maximizing \(H\)-colorings of a regular graph
- Gibbs measures for the fertile three-state hard-core models on a Cayley tree
- Phase transition of the reconstructability of a general model with different in-community and out-community mutations on an infinite tree
- Extremal H‐Colorings of Graphs with Fixed Minimum Degree
- A Three State Hard-Core Model on a Cayley Tree
- Gibbs measures for HC-model with a cuountable set of spin values on a Cayley tree
- Weakly periodic Gibbs measures for the HC model with a countable set of spin values
- Gibbs measures for a hard-core model with a countable set of states
- Pirogov-Sinai theory for the hard-core model beyond lattices
- Uniqueness and nonuniqueness conditions for weakly periodic Gibbs measures for the hard-core model with a countable set of spin values
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas
- Nonmonotonicity of phase transitions in a loss network with controls
This page was built for publication: The multistate hard core model on a regular tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094949)