11 problems
Let ) be the root of a tree, let denote the broadcast labeling on its vertices, and consider message-passing algorithms whose messages take values in an alphabet …
Non-integer BP solution conjecture. The non-integer solution extends beyond the small vicinity of and transitions smoothly as into the fully ho…
Finite-termination conjecture. If is unique, then the min-sum auction I algorithm terminates after finitely many iterations when this condition is removed from step (4).
Unique-fixed-point conjecture. If , then this recursion has a unique fixed point for every
For a counter-braid ensemble, let denote the area threshold, namely the value at which the area under the relevant extended belief-propagation extrinsic informatio…
In the large-degree regime, let and be the parameters appearing in the scalar density-evolution recursion, and let be the function defined by that recursion.…
Under the binary symmetric stochastic block model with -noisy side information, let be the estimation accuracy of belief propagation a…
Sudderth–Wainwright–Willsky conjecture. If admits a pairwise, log-supermodular factorization over , then
Let be a non-negative matrix, and let denote the fractional BP partition-function estimate at parameter . In particular, write…
Gurvits's BP upper-bound conjecture. For any non-negative , is asymptotic to . This conjecture concerns the worst-case multiplicative gap between the permanen…
Let be a code drawn from a sequence of “good” codes, and let be the channel output at the relay. Let be the output of belief p…