Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.02452 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916824320311296 |
|---|---|
| author | Couronné, Olivier |
| author_facet | Couronné, Olivier |
| contents | Stavskaya's process, a discrete-time version of the contact process on $\Z$, is known to exhibit a phase transition at a critical parameter $\alpc$ whose exact value remains an open problem. Recent work by Ramos et al. established a lower bound by linking the process's survival to the non-percolation of a dual contour. The probability of this contour was estimated using a recurrent method on a state space of weighted random walks with short-term memory. In this paper, we generalize and extend this method by systematically increasing the walk's memory and enriching the set of forbidden path sequences. By increasing the memory up to a length of 20 steps (corresponding to our parameter $n=7$), we formulate the problem with a one-step transition matrix and numerically optimize its spectral radius. We thus establish the new lower bound $\alpc > 0.1370721$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02452 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Improved Lower Bound for the Critical Parameter of the Stavskaya's Process via a Generalized Recurrent Method Couronné, Olivier Probability Stavskaya's process, a discrete-time version of the contact process on $\Z$, is known to exhibit a phase transition at a critical parameter $\alpc$ whose exact value remains an open problem. Recent work by Ramos et al. established a lower bound by linking the process's survival to the non-percolation of a dual contour. The probability of this contour was estimated using a recurrent method on a state space of weighted random walks with short-term memory. In this paper, we generalize and extend this method by systematically increasing the walk's memory and enriching the set of forbidden path sequences. By increasing the memory up to a length of 20 steps (corresponding to our parameter $n=7$), we formulate the problem with a one-step transition matrix and numerically optimize its spectral radius. We thus establish the new lower bound $\alpc > 0.1370721$. |
| title | An Improved Lower Bound for the Critical Parameter of the Stavskaya's Process via a Generalized Recurrent Method |
| topic | Probability |
| url | https://arxiv.org/abs/2507.02452 |