We consider a class of random processes on graphs that include the discrete Bak–Sneppen process and several versions of the contact process, with a focus on the former. These processes are parametrized by a probability 0 ≤ p ≤ 1 that controls a local update rule, and often exhibit a phase transition in this parameter. In general, analyzing properties of the phase transition is challenging, even for one-dimensional chains. In this article we consider a power-series approach based on representing certain quantities, such as the survival probability or the expected number of steps per site to reach the steady state, as a power series in p. We prove that the coefficients of those power series stabilize for various families of graphs, including the family of chain graphs. This phenomenon has been used in the physics community but was not yet proven. We also show that for local events A, B of which the support is a distance d apart we have cor( A, B) = O(pd). The stabilization allows for the (exact) computation of coefficients for arbitrary large systems which can then be analyzed using the wide range of existing methods of power series analysis.
, , ,
Alibaba Quantum Laboratory, Alibaba Group, Bellevue, USA
Journal of Statistical Physics
Quantum algorithms and applications , Networks
Algorithms and Complexity

Bannink, T., Buhrman, H., Gilyén, A., & Szegedy, M. (2019). The interaction light cone of the discrete Bak–Sneppen, contact and other local processes. Journal of Statistical Physics, 176, 1500–1525. doi:10.1007/s10955-019-02351-y