A note on the random greedy independent set algorithm
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2013
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914955333206016 |
|---|---|
| author | Bennett, Patrick Bohman, Tom |
| author_facet | Bennett, Patrick Bohman, Tom |
| contents | Let $r\ge 3$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D > N^\varepsilon $ for some $ \varepsilon>0 $. Consider the random greedy algorithm for forming an independent set in $ \mathcal{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 that $v$ is not in the current independent set $I$ and $ I \cup \{v\}$ contains no edge in $ \mathcal{H}$). Note that this process terminates at a maximal subset of vertices with the property that this set contains no edge of $ \mathcal{H} $; that is, the process terminates at a maximal independent set.
We prove that if $ \mathcal{H}$ satisfies certain degree and codegree conditions then there are $ Ω\left( N \cdot ( (\log N) / D )^{\frac{1}{r-1}} \right) $ vertices in the independent set produced by the random greedy algorithm with high probability. This result generalizes a lower bound on the number of steps in the $ H$-free process due to Bohman and Keevash and produces objects of interest in additive combinatorics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1308_3732 |
| institution | arXiv |
| publishDate | 2013 |
| record_format | arxiv |
| spellingShingle | A note on the random greedy independent set algorithm Bennett, Patrick Bohman, Tom Combinatorics Let $r\ge 3$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D > N^\varepsilon $ for some $ \varepsilon>0 $. Consider the random greedy algorithm for forming an independent set in $ \mathcal{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 that $v$ is not in the current independent set $I$ and $ I \cup \{v\}$ contains no edge in $ \mathcal{H}$). Note that this process terminates at a maximal subset of vertices with the property that this set contains no edge of $ \mathcal{H} $; that is, the process terminates at a maximal independent set. We prove that if $ \mathcal{H}$ satisfies certain degree and codegree conditions then there are $ Ω\left( N \cdot ( (\log N) / D )^{\frac{1}{r-1}} \right) $ vertices in the independent set produced by the random greedy algorithm with high probability. This result generalizes a lower bound on the number of steps in the $ H$-free process due to Bohman and Keevash and produces objects of interest in additive combinatorics. |
| title | A note on the random greedy independent set algorithm |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1308.3732 |