Propagation Connectivity of Random Hypergraphs

DOI10.1007/978-3-642-04944-6_10MaRDI QIDQ5902240zbMATH OpenOpenAlexFDO

Authors Robert Berke, Mikael Onsjö

Publication date 19 November 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL http://ddd.uab.cat/record/60946

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Nonnumerical algorithms (68W05)

Recommendations

• Propagation connectivity of random hypergraphs
• Propagation connectivity of random hypergraphs
• Message passing algorithms for MLS-3LIN problem
• Message passing algorithms for MLS-3LIN problem
• Random Horn formulas and propagation connectivity for directed hypergraphs

Cites work

• An efficient sparse regularity concept
• Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• Some optimal inapproximability results

Cited in

(6)

• Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
• Message passing algorithms for MLS-3LIN problem
• Propagation connectivity of random hypergraphs
• Message passing algorithms for MLS-3LIN problem
• Propagation connectivity of random hypergraphs
• Exploring the sharp propagation connectivity threshold in hypergraphs

This page was built for publication: Propagation Connectivity of Random Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902240)