Propagation Connectivity of Random Hypergraphs

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.

[1]  R. Durrett.  Probability: Theory and Examples , 1993 .

[2]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[3]  Michael Molloy,et al.  The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  M. Mitzenmacher,et al.  Probability and Computing: Chernoff Bounds , 2005 .

[5]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[6]  B. Bollobás.  The evolution of random graphs , 1984 .

[7]  Osamu Watanabe,et al.  Propagation Connectivity of Random Hypergraphs , 2010, APPROX-RANDOM.

[8]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[9]  Michael Alekhnovich.  More on Average Case vs Approximation Complexity , 2011, computational complexity.

[10]  Alan M. Frieze,et al.  An efficient sparse regularity concept , 2009, SODA.

[11]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[12]  R.W.R. Darling,et al.  Structure of large random hypergraphs , 2005 .

[13]  Sudebkumar Prasant Pal,et al.  Efficient Prüfer-Like Coding and Counting Labelled Hypertrees , 2006, Algorithmica.

[14]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[15]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[16]  Amin Coja-Oghlan,et al.  Local Limit Theorems for the Giant Component of Random Hypergraphs† , 2014, Combinatorics, Probability and Computing.

[17]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[18]  S. Ross.  A random graph , 1981 .

[19]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[20]  Michael Molloy,et al.  Cores in random hypergraphs and Boolean formulas , 2005, Random Struct. Algorithms.

[21]  Osamu Watanabe,et al.  Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions , 2009, Theory of Computing Systems.

[22]  Cristopher Moore,et al.  Counting connected graphs and hypergraphs via the probabilistic method , 2007, Random Struct. Algorithms.

[23]  Osamu Watanabe,et al.  Finding Most Likely Solutions , 2007, Theory of Computing Systems.