Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Relations between random coding exponents and the statistical physics of random codes
IEEE Transactions on Information Theory
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Weight distributions of multi-edge type LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Decimation algorithm based on correlations for constraint satisfaction problems on random networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Iterative decoding algorithms of LDPC codes using TAP approach
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Error exponents of optimum decoding for the interference channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
IEEE Transactions on Information Theory
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
IEEE Transactions on Information Theory
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
IEEE Transactions on Information Theory
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the statistical physics of directed polymers in a random medium and their relation to tree codes
IEEE Transactions on Information Theory
Statistical physics of signal estimation in Gaussian noise: theory and examples of phase transitions
IEEE Transactions on Information Theory
Efficient sequential clamping for lifted message passing
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
A new approach to the orientation of random hypergraphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Unsatisfiability bounds for random CSPs from an energetic interpolation method
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Message-Passing Algorithms for Sparse Network Alignment
ACM Transactions on Knowledge Discovery from Data (TKDD)
Limits of local algorithms over sparse random graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.54 |
This book presents a unified approach to a rich and rapidly evolving research domain at the interface between statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. It is accessible to graduate students and researchers without a specific training in any of these fields. The selected topics include spin glasses, error correcting codes, satisfiability, and are central to each field. The approach focuses on large random instances, adopting a common probabilistic formulation in terms of graphical models. It presents message passing algorithms like belief propagation and survey propagation, and their use in decoding and constraint satisfaction solving. It also explains analysis techniques like density evolution and the cavity method, and uses them to study phase transitions.