Front Propagation with Rejuvenation in Flipping Processes
| dc.creator | Antal, T. | |
| dc.creator | ben-Avraham, D. | |
| dc.creator | Ben-Naim, E. | |
| dc.creator | Krapivsky, P. L. | |
| dc.date | 2008-08-01 | |
| dc.date.accessioned | 2026-07-07T10:10:10Z | |
| dc.date.available | 2026-07-07T10:10:10Z | |
| dc.description | We study a directed flipping process that underlies the performance of the random edge simplex algorithm. In this stochastic process, which takes place on a one-dimensional lattice whose sites may be either occupied or vacant, occupied sites become vacant at a constant rate and simultaneously cause all sites to the right to change their state. This random process exhibits rich phenomenology. First, there is a front, defined by the position of the left-most occupied site, that propagates at a nontrivial velocity. Second, the front involves a depletion zone with an excess of vacant sites. The total excess D_k increases logarithmically, D_k ~ ln k, with the distance k from the front. Third, the front exhibits rejuvenation -- young fronts are vigorous but old fronts are sluggish. We investigate these phenomena using a quasi-static approximation, direct solutions of small systems, and numerical simulations. | |
| dc.description | 10 pages, 9 figures, 4 tables | |
| dc.identifier | https://arxiv.org/abs/0808.0159 | |
| dc.identifier | http://arxiv.org/abs/0808.0159 | |
| dc.identifier | J. Phys. A 41, 465002 (2008) | |
| dc.identifier | doi:10.1088/1751-8113/41/46/465002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171536 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Probability | |
| dc.title | Front Propagation with Rejuvenation in Flipping Processes | |
| dc.type | text |