An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs
Data Structures and Algorithms
2019-01-16 v1
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.
Cite
@article{arxiv.1901.04934,
title = {An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs},
author = {George Bissias},
journal= {arXiv preprint arXiv:1901.04934},
year = {2019}
}