Subadditivity Beyond Trees and the Chi-Squared Mutual Information
暂无分享,去创建一个
[1] Y. Peres,et al. Broadcasting on trees and the Ising model , 2000 .
[2] Yihong Wu,et al. Strong data-processing inequalities for channels and Bayesian networks , 2015, 1508.06025.
[3] Andrea Montanari,et al. Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration , 2013, APPROX-RANDOM.
[4] Andrea Montanari,et al. Asymptotic Mutual Information for the Two-Groups Stochastic Block Model , 2015, ArXiv.
[5] Laurent Massoulié,et al. Group Synchronization on Grids , 2017, Mathematical Statistics and Learning.
[6] Laurent Massoulié,et al. Community Detection in the Labelled Stochastic Block Model , 2012, ArXiv.
[7] Amit Singer,et al. Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery , 2014, IEEE Transactions on Network Science and Engineering.
[8] Emmanuel Abbe,et al. An Information-Percolation Bound for Spin Synchronization on General Graphs , 2018, ArXiv.
[9] Yihong Wu,et al. Application of information-percolation method to reconstruction problems on graphs , 2018, ArXiv.
[10] R. Dobrushin. The problem of uniqueness of a gibbsian random field and the problem of phase transitions , 1968 .