Propagation Connectivity of Random Hypergraphs
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.
KeywordsRandom Walk Constraint Satisfaction Problem Giant Component Good Pair Propagation Connectivity
Unable to display preview. Download preview PDF.
- [CM04]Connamacher, H., Molloy, M.: The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem. In: Proc. 45th Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 590–599. IEEE, Los Alamitos (2004)Google Scholar
- [COW10]Coja-Oghlan, A., Onsjö, M., Watanabe, O.: Propagation connectivity of random hypergraphs, Research Report C-271, Dept. Math. Comput. Sci., Tokyo Inst. of Tech. (2010)Google Scholar
- [D05]Durrett, R.: Probability and examples, 3rd edn. (2005)Google Scholar