A note on the random greedy independent set algorithm

@article{Bennett2016ANO,
title={A note on the random greedy independent set algorithm},
author={Patrick Bennett and Tom Bohman},
journal={Random Struct. Algorithms},
year={2016},
volume={49},
pages={479-502}
}

Let r be a fixed constant and let H be an r-uniform, D-regular hypergraph on N vertices. Assume further that D > N ǫ for some ǫ > 0. Consider the random greedy algorithm for forming an independent set in H. An independent set is chosen at random by iteratively choosing vertices at random to be in the independent set. At each step we chose a vertex uniformly at random from the collection of vertices that could be added to the independent set (i.e. the collection of vertices v with the property… CONTINUE READING