Information-theoretic thresholds from the cavity method

DOI10.1145/3055399.3055420MaRDI QIDQ6827509zbMATH OpenFDO

Authors Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová

Publication date 17 August 2017

Published in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

stochastic block modelphase transitionsGibbs measuresrandom graphscavity method

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Phase transitions (general) in equilibrium statistical mechanics (82B26)

This page was built for publication: Information-theoretic thresholds from the cavity method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827509)