Reconstruction for the Potts model

DOI10.1145/1536414.1536493zbMath1304.68137OpenAlexW2019059781MaRDI QIDQ5172753

Allan Sly

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aop/1312555801

zbMATH Keywords

reconstructionPotts model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

On the inference of large phylogenies with long branches: how long is too long? ⋮ Phase transition in the sample complexity of likelihood-based phylogeny inference ⋮ The critical Ising model on trees, concave recursions and nonlinear capacity ⋮ Global alignment of molecular sequences via ancestral state reconstruction ⋮ Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling