Propagation connectivity of random hypergraphs (Q426773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6045641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propagation connectivity of random hypergraphs |
scientific article; zbMATH DE number 6045641 |
Statements
Propagation connectivity of random hypergraphs (English)
0 references
12 June 2012
0 references
Summary: We study the concept of propagation connectivity on random 3-uniform hypergraphs. 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 time-dependent random walk. Based on the analysis, we also give an upper bound on the expected running time of the simple propagation algorithm.
0 references
propagation algorithm
0 references
time-dependent random walk
0 references
0.9815439581871032
0 references
0.8538410663604736
0 references
0.7901859879493713
0 references
0.7765275835990906
0 references
0.773396372795105
0 references
