Propagation connectivity of random hypergraphs (Q426773): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:14, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Propagation connectivity of random hypergraphs |
scientific article |
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