Propagation connectivity of random hypergraphs

Authors:
Amin Coja-Oghlan;Mikael Onsjö;Osamu Watanabe
Affiliations:
Mathematics and Computer Science, University of Warwick, Coventry, UK;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology;Department of Mathematical and Computing Sciences, Tokyo Institute of Technology
Venue:
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Year:
2010

Citing 6
Cited 0

The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Cores in random hypergraphs and Boolean formulas

Random Structures & Algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Counting connected graphs and hypergraphs via the probabilistic method

Random Structures & Algorithms
Local Limit Theorems for the Giant Component of Random Hypergraphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Propagation connectivity of random hypergraphs

SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is defined for investigating the performance of a simple algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for edge probability of random 3-uniform hypergraphs such that the propagation connectivity holds. Based on our analysis, we also show the way to implement the simple algorithm so that it runs in linear time on average.