The Pile Process on a Cycle

Abstract

Consider a finite particle system in which, at each step, one particle from a vertex with a lower neighboring vertex moves to a neighboring vertex of minimum height. For the cycle C_n, started with n particles at one vertex and no particles elsewhere, we prove that the expected stabilization time is at most a constant multiple of n^3 The deterministic transportation lower bound is of order n^2. Simulations suggest that the true order should be near n^3. Chat GPT was used to reincarnate notes from 2007.