Uniqueness thresholds on trees versus graphs
From MaRDI portal
Abstract: Counter to the general notion that the regular tree is the worst case for decay of correlation between sets and nodes, we produce an example of a multi-spin interacting system which has uniqueness on the -regular tree but does not have uniqueness on some infinite -regular graphs.
Recommendations
- Uniqueness and non-uniqueness for spin-glass ground states on trees
- Decay of correlations for the hardcore model on the d-regular random graph
- scientific article; zbMATH DE number 7263059
- scientific article; zbMATH DE number 2046068
- Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
Cites work
- A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models
- Counting independent sets up to the tree threshold
- Counting without sampling
- scientific article; zbMATH DE number 1418384 (Why is no real title available?)
- Mixing in time and space for lattice spin systems: A combinatorial view
- Nonmonotonic behavior in hard-core and Widom-Rowlinson models
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
Cited in
(7)- Repetition thresholds for subdivided graphs and trees
- Uniquely tree-saturated graphs
- Branch duplication in trees: uniqueness of seeds and enumeration of seeds
- WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH?
- scientific article; zbMATH DE number 7263059 (Why is no real title available?)
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Complexity of high-dimensional identity testing with coordinate conditional sampling
This page was built for publication: Uniqueness thresholds on trees versus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957524)