Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2504.02427 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917336777228288 |
|---|---|
| author | Martineau, Sébastien Poudevigne, Rémy Rax, Paul |
| author_facet | Martineau, Sébastien Poudevigne, Rémy Rax, Paul |
| contents | Consider some matrix waiting for its coefficients to be written. For each column, sample independently a Bernoulli random variable of some parameter $p$. Seeing all this and possibly using extra randomness, Alice then chooses one spot in each column, in any way she wants. When the Bernoulli random variable of some column is equal to 1, the number 1 is written in the chosen spot. When the Bernoulli random variable of a column is 0, nothing is done on this column. We prove that, using extra randomness, it is possible for Bob to fill the empty entries with well chosen 0's and 1's so that the entries of the matrix are independent Bernoulli random variables of parameter $p$. We investigate various generalisations and variations of this problem, and use this result to revisit and generalise (nonstrict) monotonicity of the percolation threshold $p_c$ with respect to a form of graph-quotienting, namely fibrations. We also use this result to revisit the BK inequality.
In a second part, which is independent of the first one, we revisit strict monotonicity of $p_c$ with respect to fibrations, a result that naturally requires more assumptions than its nonstrict counterpart. We reprove the bond-percolation case of the result of Martineau--Severo without resorting to essential enhancements, using couplings instead. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02427 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Stochastic domination and lifts of random variables in percolation theory Martineau, Sébastien Poudevigne, Rémy Rax, Paul Probability Combinatorics 60E15, 82B43 Consider some matrix waiting for its coefficients to be written. For each column, sample independently a Bernoulli random variable of some parameter $p$. Seeing all this and possibly using extra randomness, Alice then chooses one spot in each column, in any way she wants. When the Bernoulli random variable of some column is equal to 1, the number 1 is written in the chosen spot. When the Bernoulli random variable of a column is 0, nothing is done on this column. We prove that, using extra randomness, it is possible for Bob to fill the empty entries with well chosen 0's and 1's so that the entries of the matrix are independent Bernoulli random variables of parameter $p$. We investigate various generalisations and variations of this problem, and use this result to revisit and generalise (nonstrict) monotonicity of the percolation threshold $p_c$ with respect to a form of graph-quotienting, namely fibrations. We also use this result to revisit the BK inequality. In a second part, which is independent of the first one, we revisit strict monotonicity of $p_c$ with respect to fibrations, a result that naturally requires more assumptions than its nonstrict counterpart. We reprove the bond-percolation case of the result of Martineau--Severo without resorting to essential enhancements, using couplings instead. |
| title | Stochastic domination and lifts of random variables in percolation theory |
| topic | Probability Combinatorics 60E15, 82B43 |
| url | https://arxiv.org/abs/2504.02427 |