Inference and mutual information on random factor graphs

DOI10.4230/LIPICS.STACS.2021.24MaRDI QIDQ7231547zbMATH OpenFDO

Authors Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noela Müller, Konstantinos Panagiotou, Matija Pasch

Publication date 21 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2021.24

zbMATH Keywords

inference problemsinformation theoryphase transitionsrandom factor graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Compressed sensing
• Conditional random fields, planted constraint satisfaction, and entropy concentration
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Group testing: an information theory perspective
• Information, Physics, and Computation
• Information-theoretic thresholds from the cavity method
• Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
• Reconstruction and estimation in the planted partition model
• Sparsely spread CDMA—a statistical mechanics-based analysis
• Spatial Coupling as a Proof Technique and Three Applications
• Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
• The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
• The condensation phase transition in random graph coloring
• The rank of sparse random matrices
• Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels
• Tight Bounds for LDPC and LDGM Codes Under MAP Decoding

This page was built for publication: Inference and mutual information on random factor graphs

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