Reconstruction for the Potts model

From MaRDI portal
Publication:717882

DOI10.1214/10-AOP584zbMath1234.60095arXiv0811.1208MaRDI QIDQ717882

Allan Sly

Publication date: 10 October 2011

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.1208



Related Items

Reconstructibility of a general DNA evolution model, Phase transition for the Ising model with mixed spins on a Cayley tree, Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees, Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems, The Swendsen–Wang dynamics on trees, Combinatorial statistics and the sciences, Existence of gradient Gibbs measures on regular trees which are not translation invariant, Spectral measures of factor of i.i.d. processes on vertex-transitive graphs, Non-robust phase transitions in the generalized clock model on trees, Reconstruction and estimation in the planted partition model, The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations, Extremality of translation-invariant phases for a three-state SOS-model on the binary tree, Charting the replica symmetric phase, Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects, Fuzzy transformations and extremality of Gibbs measures for the potts model on a Cayley tree, Sufficient condition for root reconstruction by parsimony on binary trees with general weights, On the computational tractability of statistical estimation on amenable graphs, Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels, The replica symmetric phase of random constraint satisfaction problems, Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree, Gibbs measures of Potts model on Cayley trees: A survey and applications, Broadcasting on random recursive trees



Cites Work