Percolation Inequalities and Decision Trees
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916367183118336 |
|---|---|
| author | Gladkov, Nikita |
| author_facet | Gladkov, Nikita |
| contents | The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and other inequalities. These inequalities are then applied to estimate the connection probabilities in Bernoulli bond percolation on general graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_08457 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Percolation Inequalities and Decision Trees Gladkov, Nikita Probability Combinatorics 60K35, 05C80, 82B43 The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and other inequalities. These inequalities are then applied to estimate the connection probabilities in Bernoulli bond percolation on general graphs. |
| title | Percolation Inequalities and Decision Trees |
| topic | Probability Combinatorics 60K35, 05C80, 82B43 |
| url | https://arxiv.org/abs/2408.08457 |