A note on the random greedy independent set algorithm

  title={A note on the random greedy independent set algorithm},
  author={Patrick Bennett and Tom Bohman},
  journal={Random Struct. Algorithms},
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

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
4 Extracted Citations
28 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-4 of 4 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 28 references

On tail probabilities for martingales

  • D. A. Freedman
  • Ann. Probability 3
  • 1975
Highly Influential
2 Excerpts

Probability inequalities for sums of bounded variables

  • W. Hoeffding
  • Journal of the American Statistical Association…
  • 1963
Highly Influential
2 Excerpts

Wormald , Random graph processes with degree restrictions

  • A. Ruciński, N.
  • SIAM Journal on Discrete Mathematics
  • 2014

Similar Papers

Loading similar papers…