Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Some optimal inapproximability results
Journal of the ACM (JACM)
More on Average Case vs Approximation Complexity
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Efficient prüfer-like coding and counting labelled hypertrees
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Propagation connectivity of random hypergraphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
| Hi-index | 0.00 |
We consider the average-case MLS-3LIN problem, the problem of finding a most likely solution for a given system of perturbed 3LIN-equations generated with equation probability p and perturbation probability q. Our purpose is to investigate the situation for certain message passing algorithms to work for this problem whp We consider the case q = 0 (no perturbation occurs) and analyze the execution of (a simple version of) our algorithm. For characterizing problem instances for which the execution succeeds, we consider their natural 3-uniform hypergraph representation and introduce the notion of "propagation connectivity", a generalized connectivity property on 3-uniform hypergraphs. The execution succeeds on a given system of 3LIN-equations if and only if the representing hypergraph is propagation connected. We show upper and lower bounds for equation probability p such that propagation connectivity holds whp on random hypergraphs representing MLS-3LIN instances.