Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm

arXiv:1909.12353 · cs.DS, cs.DM, math.CO, math.PR · Submitted 2019-09-26 · Read on arXiv

cs.DS, cs.DM, math.CO, math.PR

Submitted: 2019-09-26

Updated: 2026-10-27

Terminology

• Hypergraph — 3× in this paper · explained in 2 episodes
• Hypergraphs — 1× in this paper · explained in 2 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing