Uniqueness thresholds on trees versus graphs
classification
🧮 math.PR
keywords
regularuniquenessgraphstreecasecorrelationcounterdecay
read the original 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 $d$-regular tree but does not have uniqueness on some infinite $d$-regular graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.