Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.05913 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914182728777728 |
|---|---|
| author | Denisov, Denis Shneer, Seva Wachtel, Vitali |
| author_facet | Denisov, Denis Shneer, Seva Wachtel, Vitali |
| contents | We consider $N$ counters taking integer values which are subject to the following dynamics. At every time, a pair of distinct counters is chosen uniformly at random and their states are updated according to the following rule. If the states are different, then the smaller one is increased by $1$, while if the states are the same, both of them are increased by $1$. We show that, for a fixed $N$, the distances between consecutive ordered counters form a positive recurrent Markov chain and there exists the speed $V(N)$ defined as the average number of counters updated per time step in the stationary regime. We provide non-trivial upper and lower bounds for $V(N)$ as $N\to \infty$. Despite the simple formulation of the problem, its analysis seems to be highly complicated. We also provide a list of open problems and discuss various methods one may want to use, and obstacles one encounters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_05913 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A model of discrete interacting updates Denisov, Denis Shneer, Seva Wachtel, Vitali Probability 60J10, 60G50 We consider $N$ counters taking integer values which are subject to the following dynamics. At every time, a pair of distinct counters is chosen uniformly at random and their states are updated according to the following rule. If the states are different, then the smaller one is increased by $1$, while if the states are the same, both of them are increased by $1$. We show that, for a fixed $N$, the distances between consecutive ordered counters form a positive recurrent Markov chain and there exists the speed $V(N)$ defined as the average number of counters updated per time step in the stationary regime. We provide non-trivial upper and lower bounds for $V(N)$ as $N\to \infty$. Despite the simple formulation of the problem, its analysis seems to be highly complicated. We also provide a list of open problems and discuss various methods one may want to use, and obstacles one encounters. |
| title | A model of discrete interacting updates |
| topic | Probability 60J10, 60G50 |
| url | https://arxiv.org/abs/2512.05913 |