Advertisement

Propagation Connectivity of Random Hypergraphs

  • Robert Berke
  • Mikael Onsjö
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5792)

Abstract

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.

Keywords

Random Graph Initial Assignment Equation Probability Propagation Connectivity Marked Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ale03]
    Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. FOCS 2003, pp. 298–307. IEEE, Los Alamitos (2003)Google Scholar
  2. [CCF09]
    Coja-Oghlan, A., Cooper, C., Frieze, A.M.: An efficient sparse regularity concept. In: Proc. SODA 2009, pp. 207–216 (2009)Google Scholar
  3. [MMC98]
    McEliece, R., MacKay, D., Cheng, J.: Turbo decoding as an instance of Pearl’s “Belief Propagation” algorithm. IEEE Journal on Selected Areas in Communications 16(2), 140–152 (1998)CrossRefGoogle Scholar
  4. [ER61]
    Erdős, P., Rényi, A.: On the evolution of random graphs. Bull. Inst. Internat. Statist. 38, 343–347 (1961)MathSciNetzbMATHGoogle Scholar
  5. [Has01]
    Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [OW09]
    Onsjö, M., Watanabe, O.: Finding most likely solutions. In: Theory of Computing Systems. On-Line Version (2009)Google Scholar
  7. [Pea88]
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)zbMATHGoogle Scholar
  8. [SP06]
    Shannigrahi, S., Pal, S.: Efficient Prüfer-like coding and counting labelled hypertrees. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 588–597. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. [WY07]
    Yamamoto, M., Watanabe, O.: Belief propagation and spectral methods. Research Report C-248, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech. (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Robert Berke
    • 1
  • Mikael Onsjö
    • 1
  1. 1.Dept. of Mathematical and Computing SciencesTokyo Institute of TechnologyTokyoJapan

Personalised recommendations