Large deviations of the greedy independent set algorithm on sparse random graphs
arXiv:2011.04613 · doi:10.1002/rsa.21064
Abstract
We study the greedy independent set algorithm on sparse Erdős-Rényi random graphs . This range of is of interest due to the threshold at , beyond which it appears that greedy algorithms are affected by a sudden change in the independent set landscape. A large deviation principle was recently established by Bermolen et al. (2020), however, the proof and rate function are somewhat involved. Upper bounds for the rate function were obtained earlier by Pittel (1982). By discrete calculus, we identify the optimal trajectory realizing a given large deviation and obtain the rate function in a simple closed form. In particular, we show that Pittel's bounds are sharp. The proof is brief and elementary. We think the methods presented here will be useful in analyzing the tail behavior of other random growth and exploration processes.
arXiv commentAdded ref. to Pittel (1982)
References in corpus (5)
- The large deviation approach to statistical mechanics
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
- A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph
- Large deviations for subcritical bootstrap percolation on the random graph
- Scaling Limits and Generic Bounds for Exploration Processes