An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs
George Bissias
TL;DR
This paper introduces an algorithm to estimate the probability of r-core formation in k-uniform hypergraphs, which is relevant for analyzing failure rates in data structures and satisfiability of boolean formulas.
Contribution
The paper presents a novel algorithm specifically designed to bound the probability of r-core formation in k-uniform hypergraphs, advancing theoretical understanding.
Findings
Provides bounds on r-core formation probability
Applicable to IBLT failure analysis
Enhances understanding of boolean formula satisfiability
Abstract
We present an algorithm for bounding the probability of r-core formation in k-uniform hypergraphs. Understanding the probability of core formation is useful in numerous applications including bounds on the failure rate of Invertible Bloom Lookup Tables (IBLTs) and the probability that a boolean formula is satisfiable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Graph Theory and Algorithms · Data Mining Algorithms and Applications