English

A simple rank-based Markov chain with self-organized criticality

Probability 2017-01-20 v4

Abstract

We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit interval and evolves according to the following rules. In each time step, a particle is added at a uniformly chosen position, independent of the particles that are already present. If there are any particles to the left of the newly arrived particle, then the left-most of these is removed. We show that all particles arriving to the left of pc=1e1p_{\rm c}=1-e^{-1} are a.s. eventually removed, while for large enough time, particles arriving to the right of pcp_{\rm c} stay in the system forever.

Keywords

Cite

@article{arxiv.1405.3609,
  title  = {A simple rank-based Markov chain with self-organized criticality},
  author = {Jan M. Swart},
  journal= {arXiv preprint arXiv:1405.3609},
  year   = {2017}
}

Comments

13 pages. Compared to the previous version, the proofs have been much simplified and the results strengthened. The Stigler-Luckock model that appeared in the second version of the manuscript is now treated in arXiv:1605.01551

R2 v1 2026-06-22T04:14:19.035Z