Mikael Onsjö

Learn More
We study the concept of propagation connectivity on random 3-uniform hyper-graphs. This concept is inspired by a simple propagation algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for the propagation connectivity threshold. Our proof is based on a kind of large deviations analysis of a(More)
  • 1