The Power Light Cone of the Discrete Bak-Sneppen, Contact and other local processes

TL;DR

This paper develops a power-series method to analyze phase transitions in local graph processes like the Bak-Sneppen and contact processes, proving coefficient stabilization and decay of correlations with distance.

Contribution

It introduces a novel power-series approach to study phase transitions in local processes on graphs and proves coefficient stabilization as system size grows.

Findings

Coefficients of power series stabilize with increasing chain length

Correlation between distant local events decays as p^d

Method enables exact computation for large systems

Abstract

We consider a class of random processes on graphs that include the discrete Bak-Sneppen (DBS) process and the several versions of the contact process (CP), with a focus on the former. These processes are parametrized by a probability $0\leq p \leq 1$ that controls a local update rule. Numerical simulations reveal a phase transition when $p$ goes from 0 to 1. Analytically little is known about the phase transition threshold, 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 as the length $n$ of the chain grows. This is a phenomenon that has been used in the physics community but was not yet proven. We show that for local events $A,B$ of which the support is a distance $d$ apart we have $\mathrm{cor}(A,B) = \mathcal{O}(p^d)$. 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.

Tables

Table 1. Table 1 : Table of the coefficients a k ( n ) subscript superscript 𝑎 𝑛 𝑘 a^{(n)}_{k} of the power series defined in Equation ( 1 ). Although displayed with finite precision, they were computed symbolically.

	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17
3	0	1	2	3+1/3	5.00	7.00	9.33	12.00	15.00	18.33	22.00	26.00	30.33	35.00	40.00	45.333	51.000	57.000
4	0	1	2	3+2/3	6.16	9.66	14.3	20.33	27.83	37.00	48.00	61.00	76.16	93.66	113.6	136.33	161.83	190.33
5	0	1	2	3+2/3	6.44	10.8	17.3	26.65	39.43	56.48	78.65	106.9	142.2	185.8	238.7	302.41	378.05	467.13
6	0	1	2	3+2/3	6.44	11.0	18.5	30.02	47.10	71.68	106.0	152.9	215.4	297.4	403.1	537.21	705.25	913.31
7	0	1	2	3+2/3	6.44	11.0	18.7	31.21	50.83	80.80	125.3	189.7	280.8	407.0	578.6	808.13	1110.2	1502.6
8	0	1	2	3+2/3	6.44	11.0	18.7	31.44	52.08	84.95	136.0	213.6	328.9	496.5	735.6	1070.7	1532.5	2159.5
9	0	1	2	3+2/3	6.44	11.0	18.7	31.44	52.30	86.27	140.7	226.3	358.4	558.4	855.4	1289.0	1911.5	2791.4
10	0	1	2	3+2/3	6.44	11.0	18.7	31.44	52.30	86.49	142.1	231.6	373.4	594.8	934.4	1447.1	2209.0	3324.6
⋮
18	0	1	2	3+2/3	6.44	11.08	18.76	31.45	52.31	86.49	142.33	233.31	381.17	621.02	1009.38	1637.13	2650.56	4284.31

Table 2. Table 2 : Table of the coefficients b k [ n ] subscript superscript 𝑏 delimited-[] 𝑛 𝑘 b^{[n]}_{k} of the power series defined in Equation ( 2 ). Although displayed with finite precision, they were computed symbolically.

	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
3	1	0	-2	-2	0	4	6	2	-8	-16	-10	14	40	36	-18	-94
4	1	0	-2	-4	-3.50	5.75	22.25	31.31	1.91	-89.13	-200.21	-171.80	220.35	992.97	1513.93	352.89
5	1	0	-2	-4	-8.25	-2.46	23.94	76.89	127.93	50.05	-357.65	-1208.56	-2034.75	-1004.08	5178.29	18688.02
6	1	0	-2	-4	-8.25	-13.65	2.11	76.61	239.51	422.23	325.17	-860.92	-4423.36	-10847.19	-15746.83	-2393.70
7	1	0	-2	-4	-8.25	-13.65	-24.58	19.20	221.39	689.37	1325.77	1325.82	-1515.32	-12291.20	-38583.12	-81814.55
8	1	0	-2	-4	-8.25	-13.65	-24.58	-44.71	69.28	599.01	1939.94	3969.88	4778.48	-1873.44	-30668.24	-112066.49
9	1	0	-2	-4	-8.25	-13.65	-24.58	-44.71	-84.21	196.95	1590.70	5328.67	11662.68	15977.89	1408.10	-75058.95
10	1	0	-2	-4	-8.25	-13.65	-24.58	-44.71	-84.21	-172.29	531.63	4131.50	14490.20	33615.60	51447.00	22246.40

Equations

$$R_{(n)}(p)$$

$$S_{[n]}(q)$$

$$R_{(4)}(p)$$

$$a_k^{(n)}$$

$$\mathbb{P}(L_X\mid \text{start in }A)-\mathbb{P}(L_X\mid \text{start in }{A}^{\prime })=\mathcal{O}(p^d).$$

$${\mathbb{P}}_G(L_X)={\mathbb{P}}_{G^{\prime }}(L_X)+\mathcal{O}(p^d).$$

$$\frac{1}{n}\mathbb{E}(\text{total steps})=\mathbb{E}(\text{\#times vertex 1 was picked})$$

$${\mathrm{RI}}^{(v)},{\mathrm{BA}}^{(v)},(\#\text{textsc}Asel\left(v\right)=k),(\#\text{textsc}toggles\left(v\right)=k):v\in S,0\le k<\infty .$$

$${\mathbb{P}}_G({\mathrm{RI}}^{(S)}\cap L_X\cap L_Y\mid {\mathrm{II}}^{(S)})$$

$${\mathbb{P}}_G({\mathrm{RI}}^{(S)}\cap L_X\cap L_Y)$$

$${\mathbb{P}}_G(L_X\cap L_Y\mid {\mathrm{RI}}^{(S)})$$

$${\mathbb{P}}_G(L_X)-{\mathbb{P}}_{G\setminus Y}(L_X)=\mathcal{O}(p^{d(X,Y)}).$$

$$L_X^i$$

$$L_X^{d+1}$$

$${\mathbb{P}}_G(L_X^i\mid {\mathrm{II}}^{(\overline{\partial }(X,i))})=\mathcal{O}(p^i).$$

$${\mathbb{P}}_G(L_X^i)$$

$$={\mathbb{P}}_{\Gamma (X,i)}(L_X^i\mid {\mathrm{II}}^{(\overline{\partial }(X,i))})\cdot \left({\mathbb{P}}_{G\setminus Y\setminus \Gamma (X,i-1)}({\mathrm{RI}}^{(\overline{\partial }(X,i))})+\mathcal{O}(p^{d+1-i})\right)$$

$$={\mathbb{P}}_{\Gamma (X,i)}(L_X^i\mid {\mathrm{II}}^{(\overline{\partial }(X,i))})\cdot {\mathbb{P}}_{G\setminus Y\setminus \Gamma (X,i-1)}({\mathrm{RI}}^{(\overline{\partial }(X,i))})+\mathcal{O}(p^{d+1})$$

$$={\mathbb{P}}_{G\setminus Y}(L_X^i)+\mathcal{O}(p^{d+1})$$

$$={\mathbb{P}}_{G\setminus Y}(L_X^i)+\mathcal{O}(p^{d(X,Y)}).$$

$${\mathbb{P}}_G(L_X)$$

$$\stackrel{\text{eqref}eq:AXorder}{=}{\mathbb{P}}_{G\setminus Y}(L_X)+\mathcal{O}(p^{d(X,Y)}).$$

$$\mathrm{Cov}(L_X,L_Y)={\mathbb{P}}_G(L_X\cap L_Y)-{\mathbb{P}}_G(L_X){\mathbb{P}}_G(L_Y)=\mathcal{O}(p^{d(X,Y)-1}),$$

$${\mathbb{P}}_G({\mathrm{BA}}^{(X)}\cap {\mathrm{BA}}^{(Y)})-{\mathbb{P}}_G({\mathrm{BA}}^{(X)}){\mathbb{P}}_G({\mathrm{BA}}^{(Y)})=\mathcal{O}(p^{d(X,Y)+1}).$$

$${\mathbb{P}}_G(A\text{ is transformed to }{A}^{\prime })={\mathbb{P}}_{G^{\prime }}(i(A)\text{ is transformed to }i(A^{\prime })),$$

$${\mathbb{P}}_G(\text{graph state is initially }A)={\mathbb{P}}_{G^{\prime }}(\text{graph state is initially }i(A^{\prime })).$$

$$M_G\underset{X^{\prime }}{\stackrel{X}{\simeq }}{M}_{G^{\prime }}.$$

$${\mathbb{E}}_{G_i}(\#\text{textsc}Asel\left(v_i\right))$$

$$=\sum _{k\ge 0}k\cdot {\mathbb{P}}_{G_i\cap {\Gamma }_{G_i}\left(v_i,d\right)}\left(\#\text{textsc}Asel\left(v_i\right)=k\right)+\mathcal{O}(p^{d+1})$$

$$=\sum _{k\ge 0}k\cdot {\mathbb{P}}_{G_j\cap {\Gamma }_{G_j}\left(v_j,d\right)}\left(\#\text{textsc}Asel\left(v_j\right)=k\right)+\mathcal{O}(p^{d+1})$$

$$=\sum _{k\ge 0}k\cdot {\mathbb{P}}_{G_j}\left(\#\text{textsc}Asel\left(v_j\right)=k\right)+\mathcal{O}(p^{d+1}).$$

$$R_{(n)}(p)$$

$$=\frac{1}{n}\sum _{k=1}^{\infty }{\rho }^{(0)}\cdot M_{(n)}^{k-1}\cdot J^T$$

$$=\frac{1}{n}{\rho }^{(0)}\cdot (\mathrm{Id}-M_{(n)}{)}^{-1}\cdot J^T$$

$$=\frac{P_{(n)}(p)}{P_{(n)}^{\prime }(p)},$$

$$R_{(n)}(p)=\sum _{k=0}^{\infty }{a}_k^{(n)}{p}^k,$$

$$S_{[n]}(p)=\mathbb{P}({\mathrm{BA}}^{(\{n\})}\mid \text{start }\{1\}).$$

Full text

1 Introduction

In physics, critical behaviour involves systems in which correlations decay as a power law with distance. It is an important topic in many areas of physics and can also be found in stochastic processes on graphs. Often, such systems have a parameter (e.g. temperature) and when it is set to a critical value, the system exhibits critical behaviour. Power series expansion techniques have been used in the physics literature to numerically approximate critical values and associated exponents. It was often observed that the coefficients of such power series stabilize when the system size grows, and we provide a rigorous proof of this for a large class of stochastic processes.

Self-organized criticality is a name common to models where the critical behaviour is present but without the need of tuning a parameter. A simple model for evolution and self-organized criticality was proposed by Bak and Sneppen [BS93] in 1993. In this random process there are $n$ vertices on a cycle each representing a species. Every vertex has a fitness value in $[0,1]$ and the dynamics is defined as follows. Every time step, the vertex with the lowest fitness value is chosen and that vertex together with its two neighbors get replaced by three independent uniform random samples from $[0,1]$. The model exhibits self-organized criticality, as most of the fitness values automatically become distributed uniformly in $[f_{c},1]$ for some critical value $0<f_{c}<1$. This process has received a lot of attention [dBDF*+*94, Mar94, Bak96, MDLRM98], and a discrete version of the process has been introduced in [BK01]. In the discrete Bak-Sneppen (DBS) process, the fitness values can only be [math] or $1$. At every time step, choose a uniform random vertex with value [math] and replace it and its two neighbors by three independent values, which are [math] with probability $p$ and $1$ with probability $1-p$. The DBS process has a phase transition with associated critical value $p_{c}$ [MZ02, Ban05].

The Bak-Sneppen process was originally described in the context of evolutionary biology but its study has much broader consequences, e.g., the process was rediscovered in the setting of theoretical computer science [CCS*+*17]. To study the limits of a randomized algorithm for solving satisfiability, the discrete Bak-Sneppen process turned out to be a natural process to analyze.

The DBS process is closely related to the so-called contact process (CP), originally introduced in [Har74]. Sometimes referred to as the basic contact process, this process models the spreading of an epidemic on a graph where each vertex (an individual) can be healthy or infected. Infected individuals can become healthy (probability $1-p$), or infect a random neighbor (probability $p$). The contact process has also been studied in the context of interacting particle systems and many variants of it exist, such as a parity-preserving version [Inu95] and a contact process that only infects in one direction [TIK97]. Depending on the particular flavor of the processes, the CP and DBS processes are closely related [Ban05] and in certain cases have the same critical values. The processes are similar in the sense that vertices can be active (fitness 0 or infected) or inactive (fitness 1 or healthy). The dynamics only update the state in the neighborhood of active vertices with a simple local update rule. In this article we consider a wide class of processes that fit this description, and our proofs are valid in this general setting. We will, however, focus on the DBS process when we present explicit examples.

In this paper we take a power-series approach and represent several probabilities and expectation values as a power series in the parameter $p$. There is a wealth of physics literature on series analysis in the theory of critical phenomena, see for example [HB73, BH73, HB79] for an overview. Processes typically only have a critical point when the system size is infinite, but numerical simulations often only allow for probing of finite systems. Our main theorem proves, for our general class of processes, that one can extract coefficients of the power series for an arbitrary large system by computing quantities in only a finite system. One can then apply series analysis techniques to these coefficients of the large system. Series expansion techniques are not new, they have been extensively used for variants of the contact process as well as for closely related directed percolation models [Dic89, JD93, Inu95, IK96, TIK97, Inu98, KTIK99] in order to extract information about critical values and exponents. For example, in [TIK97] the contact process on a line is studied where infection only happens in one direction. In [Inu95] a process is studied where the parity of the number of active vertices is preserved. In both articles, the power series of the survival probability is computed up to 12 terms and used to find estimates for the critical values and exponents. However, in all this work the stabilization of coefficients has been observed666Some work uses stabilization in the number of time steps instead of system size. However, for understanding the critical behavior, system size is the relevant parameter. but not proven.

Our main contribution is a definition of a general class of processes that encapsulates most of the above processes (Definition 2) and an in-depth understanding of the stabilization phenomenon, complete with a rigorous proof (Lemma 9, Theorem 13). The results are illustrated with examples.

Road map. In Section 1.1 we will provide two example power series that exhibit the stabilization phenomenon. In Section 1.2 we will sketch our results without going into technicalities and explain the intuition behind them, something that we call the Power Light Cone. In Section 2 we define our general class of processes in more detail and provide our theorems with their proofs. In Section 3 we apply our result to the DBS process, and we compute power-series coefficients for several quantities. As an application, we apply the method of Padé approximants to extract an estimate for $p_{c}$ and we estimate a critical exponent that suggests that the DBS process is in the directed percolation universality class.

1.1 Stabilization of coefficients

There are different ways of defining the DBS process. These definitions map to each other in straightforward ways, and only slightly differ in the notion of a “time step”. For example, one can define a time step as picking a random vertex (not necessarily with value [math]) and then not do anything when it has value $1$ but still count it as a time step. To study the process for an infinite-sized system, one can consider a continuous-time version of this process with exponential clocks at every vertex. Resampling of a vertex and its neighbors happens when the clock of the vertex rings and the current value of the vertex is zero.

In this section we consider the discrete-time process on a finite system, where a [math]-vertex is picked in every time step, and the process terminates when an all-$1$ state is reached. Furthermore, we will always refer to the vertex-state [math] as active and $1$ as inactive.

From numerical simulations it is apparent that there is a phase transition in the DBS process when $p$ goes from 0 to 1. There is some critical probability $p_{c}$ such that for $p<p_{c}$ the active vertices quickly die out and the system is pushed toward a state with no active vertices. However for $p>p_{c}$, the active vertices have the overhand and dominate the system. This phase transition can clearly be seen in Figure 1 from two different perspectives: (a) We have computed the expected number of steps per vertex, on a cycle of length $n$, to reach the all-inactive state, where the vertices are initialized i.i.d. to active with probability $p$. (b) We have computed the probability that the end of a (non-periodic) chain is activated when the process is started with only one active vertex on the other end.

Let us write these functions as a power-series in $p$ and in $q=1-p$ respectively.

[TABLE]

We will define these functions in more detail in Section 3, where we show, amongst other things, that they are rational functions for each $n$. For example

[TABLE]

Although they only have an operational meaning for $p\in[0,1]$, we give a plot of such a function over the complex plane, see Figure 2. The plot shows the poles of $S_{(6)}(p)$, which seem to approach the value $p_{c}$ on the real line (for larger $n$ see Figure 5). Something similar happens for partition functions in statistical physics. The partition function is usually in the denominator of observable physical quantities, so that its zeroes are the poles of such quantities. A classic result on the partition function for certain gasses [YL52] shows that when an open region around the real axis is free of zeroes, then many physical quantities are analytic in that region and therefore there is no phase transition. In [PR18] the hardcore model on graphs with bounded degree is studied, and it is proven that the partition function has zeroes in the complex plane arbitrary close to the critical point.

For now, we simply want to highlight the behaviour of the coefficients $a^{(n)}_{k}$ and $b^{[n]}_{k}$. Table 1 and Table 2 show numerical values of the coefficients $a^{(n)}_{k}$ and $b^{[n]}_{k}$ respectively.777At first sight one is tempted to conjecture that the coefficients $a^{(n)}_{k}$ are all non-negative and are monotone increasing with $n$. Unfortunately neither of these conjectures hold since $a^{(10)}_{1114}<0$. We found this counterexample by observing that the radius of convergence for $R_{10}(p)$ is less than $0.96$, which considering that $R_{10}(p)$ is bounded on $[0,0.96]$ implies that there must be a negative coefficient in its power series.

A quick look at the table immediately reveals the stabilization of coefficients:

[TABLE]

We now know the first few terms of the power series for arbitrary large systems and we can proceed to use methods of series analysis. By applying the method of Padé approximants, we can estimate $p_{c}\approx 0.6352$. More details on this can be found in Section 3.

1.2 Locality of update rule implies stabilization

Our proofs are based on an observation that we call the Power Light Cone. Let $X$ be a set of vertices, and let $L_{X}$ be an event that is local on $X$, meaning that the event depends only on what happens to the vertices in $X$. For example, when $X=\{v_{0}\}$ and $L_{X}$ is the event that vertex $v_{0}$ is picked at least $r$ times, then $L_{X}$ is local on $X$. In Section 2 we will give a more precise definition of local events. We now wish to compare the probability $\mathbb{P}(L_{X})$ when the process is initialized in two different starting states, $A$ and $A^{\prime}$. When $A$ and $A^{\prime}$ differ only on vertices that are at least a distance $d$ away from $X$, then we have

[TABLE]

By the notation $\mathcal{O}(p^{d})$ we mean that when this quantity is written as power series in $p$, then the first $d-1$ terms of the series are zero. It only has non-zero terms of order $p^{d}$ and higher, i.e. the two probabilities agree on at least the first $d-1$ terms of their power series. This is the essence of the Power Light Cone. A vertex that is a distance $d$ away from the set $X$ will only influence probabilities and expectation values of $X$-local events with terms of order $p^{d}$ or higher. The intuition behind this is that the probability of a single activation is $\mathcal{O}(p)$ and in order for such a vertex to influence the state of a vertex in $X$, it needs to form a chain of activations of size $d$ to reach $X$. This observation will also allow us to compare the process on systems of different sizes.

Lemma 1** (Informal version of Lemma 9)**

Let $G$ and $G^{\prime}$ be two graphs and let $X$ be a set of vertices present in both graphs such that the $d$-neighborhood of $X$ and the local update process (a single update may only affect a vertex and its neighbors) on it is the same in both graphs. Then for any event $L_{X}$ that is local on $X$ we have

[TABLE]

This idea applies to expectation values as well. Consider the expected number of steps per vertex on a cycle. By translation invariance, we have

[TABLE]

making it a $\{1\}$-local quantity. If we add an extra vertex to the cycle, the expectation value only changes by a term of order $\mathcal{O}(p^{n/2})$ since the new vertex has distance $n/2$ to vertex $1$.

2 Parametrized local-update processes

The class of parametrized (discrete) local-update processes, introduced in this section, includes the DBS, the CP and many other natural processes. We prove a general ‘stabilization of the coefficients theorem’ for them, suggesting the usefulness of the power-series approach for members of the class.

Let $G=(V,E)$ be an undirected graph with vertex set $V$ and edge set $E$. We consider processes where every vertex of $G$ is either active or inactive. A state is a configuration of active/inactive vertices, denoted by the subset of active vertices $A\subseteq V$. For $v\in V$ let us denote by $\Gamma(v)$ the neighbors of $v$ in $G$ including $v$ itself. A local update process in each discrete time step picks a random active vertex $v\in A$ and resamples the state of its neighbors $\Gamma(v)$. If the state is $\emptyset$ (there are no active vertices) then the process stops and all vertices remain inactive afterwards.

Definition 2** (PLUP - Parametrized local-update process)**

We say that $M_{G}$ is a parametrized local-update process on the graph $G=(V,E)$ with parameter $p\in[0,1]$ if it is a time-independent Markov chain on the state space $\{\text{inactive},\text{active}\}^{V}$ that satisfies the following:

1. (i)

Initial state.* The initial value of a vertex is picked independently from the other vertices. The probability of initializing $v\in V$ as active is a polynomial in $p$ with constant term equal to zero.888The zero constant term is used, for example, in Lemma 8. The independence is used in Lemma 7.* 2. (ii)

Selection dynamics.* Each vertex $v\in V$ has a fixed positive weight $w_{v}$. A vertex $v\in V$ is selected using one of the three rules below, and if the selected vertex was active, then its neighborhood $\Gamma(v)$ is resampled using the parametrized local-update rule of vertex $v$.999The properties of the selection dynamics are used in the proof of Lemma 7*

1. (a)

Discrete-time active sampling.* In each discrete time step, an active vertex $v\in A$ is selected with probability $\frac{w_{v}}{\sum_{u\in A}w_{u}}$, where $A$ is the current state.* 2. (b)

Discrete-time random sampling.* In each discrete time step, a vertex $v\in V$ is selected with probability $\frac{w_{v}}{\sum_{u\in V}w_{u}}$.* 3. (c)

Continuous-time clocks.* Every vertex $v\in V$ has an exponential clock with rate $w_{v}$. When a clock rings, that vertex is selected, and a new clock is set up for the vertex.* 3. (iii)

Update dynamics.* The parametrized local-update rule of a vertex $v\in V$ describes a (time-independent) probabilistic transition from state $A$ to $A^{\prime}$ such that the states only differ on the neighborhood $\Gamma(v)$, i.e., $A\bigtriangleup A^{\prime}\subseteq\Gamma(v)$. The probability $P_{R}$ of obtaining active vertices $R=A^{\prime}\cap\Gamma(v)$ is independent of $A\setminus\Gamma(v)$. The probability $P_{R}$ is a polynomial in $p$ such that for $p=0$ we get $A^{\prime}\subsetneq A$ with probability $1$, i.e., when any previously inactive vertex becomes active ($\;|A^{\prime}\setminus A|>0$) or when $A^{\prime}=A$ then the constant term in $P_{R}$ must be zero.101010The condition $|A^{\prime}\setminus A|>0\implies P_{R}=\mathcal{O}(p)$ is used in the proof of Lemma 8: a fresh activation is at least one power of $p$ so you need $p^{k}$ to cover a distance $k$. The extra condition $A^{\prime}=A\implies P_{R}=\mathcal{O}(p)$ is used for absolute convergence in Claim 18 because without it you can have infinitely many paths with a finite power of $p$.* 4. (iv)

Termination.* The process terminates when the all-inactive state $\emptyset$ is reached.*

We write $\mathbb{P}_{G}$ and $\mathbb{E}_{G}$ for probabilities and expectation values associated to the PLUP $M_{G}$.

Definition 3** (Local events)**

Let $G=(V,E)$ be a graph and let $M_{G}$ be a PLUP. Let $S\subseteq V$ be any subset of vertices, and let $v\in V$ be any vertex.

• •

Let $\mathrm{II}^{(S)}$ be the event that all vertices in $S$ get initialized as inactive.

• •

Let $\mathrm{RI}^{(S)}$ be the event that all vertices in $S$ remain inactive during the entire process.

• •

Define $\mathrm{BA}^{(S)}$ as the complement of $\mathrm{RI}^{(S)}$: the event that there exists a vertex in $S$ that becomes active at some point during the process, including initialization.

• •

Let $\#\textsc{Asel}\left(v\right)$ be the number of times that $v$ was selected while it was active.

• •

Let $\#\textsc{toggles}\left(v\right)$ be the number of times that the value of $v$ was changed.

• •

We say an event $L$ is local on the vertex set $S$ if it is in the sigma algebra111111If $p<1$, then the process terminates with probability $1$. If we remove the [math] probability event of not terminating, then the discrete nature of the process implies that the probability space has a discrete set of atoms see, e.g., Definition 16 and Equation (13), therefore one does not need to worry about difficulties arising from $\sigma$-additivity.* generated by the events*

[TABLE]

Lemma 4** (Time equivalence)**

The three versions of the selection dynamics of a PLUP, desribed in property (ii) of Definition 2, are equivalent for local events. That is, for any local event $L$ the probability $\mathbb{P}(L)$ is independent of the chosen selection dynamics in property (ii).

**Proof. ** The three selection dynamics only differ in the counting of time, and the presence of self loops in the Markov Chain. The definition of local events only includes events that are independent of the way time is counted. They only depend on which active vertices are selected and the changes to the state of the graph.

It is easy to see that (ii)b implements the dynamics of (ii)a via rejection sampling, therefore they give rise to the same probabilities. One can also see that on a finite graph the selection rule (ii)c induces the same selection rule as (ii)b. This is because the exponential clocks induce a Poisson process at each vertex. The $n$ independent Poisson processes with rates $w_{v}$ are equivalent to one single Poisson process with rate $W=\sum_{v\in V}w_{v}$ but where each point of the single process is of type $v$ with probability $w_{v}/W$. One can simulate (ii)c by sampling a time value from an exponential distribution with parameter $W$ and then sampling a random vertex with probability $w_{v}/W$ (as in (ii)b). Since the time is not relevant for local events we can ignore the sampled time value and this gives rise to the same probabilities. $\Box$

Our lemmas and theorems only concern local events and therefore we can use any one of the three selection dynamics when proving them.

Definition 5** (Induced process)**

Suppose that $V^{\prime}\subseteq V$, then we define the induced process $M_{G^{\prime}}$ on the induced subgraph $G^{\prime}=(V^{\prime},E^{\prime})$ such that we run the process on $G$ and after each step we deactivate all vertices in $V\setminus V^{\prime}$. We can then view this as a process on $G^{\prime}$. Let $L$ be a local event on $V^{\prime}$. We denote the probability of $L$ under the induced process $M_{G^{\prime}}$ with $\mathbb{P}_{G^{\prime}}(L)$. Similarly we use the notation $\mathbb{E}_{G^{\prime}}$ for expectation values induced by the process $M_{G^{\prime}}$.

It is easy to see that the induced process of a PLUP is also a PLUP.

Definition 6** (Graph definitions)**

Let $G=(V,E)$ be a graph, $S\subseteq V$ be any subset of vertices and $v\in V$ be any vertex.

• •

Define $G\setminus S$ as the induced subgraph on $V\setminus S$ and $G\cap S$ as the induced subgraph on $S$.

• •

Define the $d$-neighbourhood $\Gamma(S,d)$ of $S$ as the set of vertices that are connected to $S$ with a path of length at most $d$. In particular $\Gamma(\{v\};1)=\Gamma(v)$.

• •

Define the distant-$k$* boundary $\overline{\partial}(S,k):=\Gamma(S,k)\setminus\Gamma(S,k-1)$ as the set of vertices lying at exactly distance $k$ from $S$, and let $\overline{\partial}S:=\overline{\partial}(S,1)$.*

The following lemma says that if a set $S$ splits the graph into two parts, then those two parts become independent under the condition that the vertices in $S$ never become active.

Lemma 7** (Splitting lemma)**

Let $M_{G}$ be a parametrized local-update process on the graph $G=(V,E)$. Let $S,X,Y\subseteq V$ be a partition of the vertices, such that $X$ and $Y$ are disconnected in the graph $G\setminus S$. Furthermore, let $L_{X}$ and $L_{Y}$ be local events on $X$ and $Y$ respectively. Then we have

[TABLE]

The condition of initializing $S$ to inactive is present only to prevent counting the initialization probabilities twice. Equivalently we could write the condition only once:

[TABLE]

and by Bayes rule we also have

[TABLE]

**Proof. ** We will use the ‘continuous-time clocks’ version of selection dynamics (PLUP property (ii)c). By Lemma 4 the statement will then hold for all versions. We proceed with a coupling argument. There are three processes, one on $G$ and the induced ones on $G\setminus Y$ and $G\setminus X$. We couple them by letting all three processes use the same source of randomness. Every vertex in $G$ has an exponential clock that is shared by all three processes, and the randomness used for the local updates for each vertex will also come from the same source. This means that when the clock of a vertex $v$ rings, and the neighborhood $\Gamma(v)$ is equal in different processes, then the update result will also be equal. Now we simply observe that $L_{X}\cap L_{Y}\cap\mathrm{RI}^{(S)}$ holds in the $G$-process if and only if $L_{X}\cap\mathrm{RI}^{(S)}$ holds in the $(G\setminus Y)$-process and $L_{Y}\cap\mathrm{RI}^{(S)}$ holds in the $(G\setminus X)$-process. This is because all vertices in $S$ are initialized as inactive (all three probabilities are conditioned on this), so a vertex in $S$ can only be activated by an update from a vertex in $X$ or $Y$. To check if the event $\mathrm{RI}^{(S)}$ holds, it is sufficient to trace the process up to the first activation of a vertex in $S$. Before this first activation, anything that happends to the vertices in $X$ only depends on the clocks and updates of vertices in $X$, and similar for $Y$. Since $S$ splits $X$ and $Y$ in disconnected parts, these parts can not influence each other unless a vertex in $S$ is activated. Because of the coupling, the evolution of the $X$ vertices in $G\setminus Y$ will be exactly the same as the evolution in $G$, and similar for $Y$. Once a vertex in $S$ does get activated, the evolution of the three processes is no longer the same but in that case the event $\mathrm{RI}^{(S)}$ does not hold, regardless of any further updates in any system. The clocks and updates of each vertex are independent sources of randomness, and when $\mathrm{RI}^{(S)}$ holds then all the randomness of the $S$ vertices is ignored. Therefore the probability of $\mathrm{RI}^{(S)}$ in the $(G\setminus Y)$-process and $(G\setminus X)$-process depends only on independent random variables and we get the required equality. $\Box$

2.1 Power Light Cone results

Now we present the results that exhibit the power light cone. The intuition is that if two vertices have distance $d$ in the graph, then the only way they can affect each other is that an interaction chain is forming between them, meaning that every vertex gets activated at least once in between them.

When we write $f(p)=\mathcal{O}(p^{k})$ for some function $f$ then we mean the following: when $f(p)$ is written as a power-series in $p$, i.e., $f(p)=\sum_{i=0}^{\infty}\alpha_{i}p^{i}$, then $\alpha_{i}=0$ for $0\leq i\leq k-1$.

Lemma 8

Let $M_{G}$ be a parametrized local-update process on the graph $G=(V,E)$. Let $X\subseteq V$ be a subset of vertices and let $E$ be an event. If $E\subseteq\bigcap_{v\in X}\mathrm{BA}^{(v)}$, then $\mathbb{P}(E)=\mathcal{O}(p^{|X|})$.

**Proof. ** When $E$ holds, all vertices in $X$ become active. By PLUP property (i) any activation in the initial state is $\mathcal{O}(p)$ and by property (iii) any subsequent activation is also $\mathcal{O}(p)$. Therefore, for any path $\xi$ of the Markov Chain with $\xi\in E$ we have $\mathbb{P}(\xi)=\mathcal{O}(p^{|X|})$, where $\mathbb{P}(\xi)$ is a polynomial in $p$. We have $\mathbb{P}(E)=\sum_{\xi\in E}\mathbb{P}(\xi)$ by definition. This is a sum over infinitely many polynomials, and by considering $\mathbb{P}(E)$ as a power series in $p$ we are effectively regrouping terms in this sum. In Appendix B we prove that these regroupings are allowed by proving the absolute convergence of certain series. $\Box$

Lemma 9** (Graph surgery)**

Let $M_{G}$ be a parametrized local-update process on the graph $G=(V,E)$. If $X,Y\subseteq V$, $X\cap Y=\emptyset$ and $L_{X}$ is a local event on $X$, then

[TABLE]

**Proof. ** We can assume without loss of generality, that $X\neq\emptyset\neq Y$, otherwise the statement is trivial. Also we can assume without loss of generality that $d(X,Y)\leq\infty$, i.e., $X,Y$ are in the same connected component of $G$, otherwise we can use Lemma 7 with $S=\emptyset$.

The proof goes by induction on $d(X,Y)$. For the base case, $d(X,Y)=1$, first note that when $p=0$, the process initializes everything to inactive by property (i). Depending on whether this atomic event is included in $L_{X}$, the probability $\mathbb{P}(L_{X})$ for $p=0$ (i.e. the constant term) is either 0 or 1 and independent of the graph.

Now we show the inductive step, assuming we know the statement for $d$, and that $d(X,Y)=d+1$. First we assume, that $\mathrm{RI}^{(X)}\subseteq\overline{L_{X}}$, i.e., $L_{X}\subseteq\mathrm{BA}^{(X)}$. Define

[TABLE]

When $L_{X}^{i}$ holds, all vertices at distance $i$ remain inactive, but for all $j\leq i-1$ there exists a vertex at distance $j$ that become active. These events form a partition $L_{X}=\dot{\bigcup}_{i\in[d+1]}L_{X}^{i}$. Below we depict $L_{X}^{i}$ graphically:

It is easy to see that for all $i\in[d+1]$ we have $L_{X}^{i}\subseteq\mathrm{BA}^{(X)}\cap\bigcap_{j\in[i-1]}\mathrm{BA}^{(\overline{\partial}(X,j))}$, and therefore by Lemma 8 we get

[TABLE]

Now we use, for all $i\in[d]$, the Splitting lemma 7 with $S=\overline{\partial}(X,i)$ to split $\Gamma(X,i-1)$ from $G\setminus\Gamma(X,i)$. We get

[TABLE]

Therefore

[TABLE]

We finish the proof by observing that by $\mathrm{RI}^{(X)}$ is an atomic event of the sigma algebra of the local events of $X$, so if $\mathrm{RI}^{(X)}\nsubseteq\overline{L_{X}}$, then we necessarily have $\mathrm{RI}^{(X)}\subseteq L_{X}$. Therefore we can use the above proof with $C_{X}:=\overline{L_{X}}$ and use that $\mathbb{P}(L_{X})=1-\mathbb{P}(C_{X})$. $\Box$

Corollary 10** (Decay of correlations)**

Let $M_{G}$ be a parametrized local-update process on the graph $G=(V,E)$. If $X,Y\subseteq V$ and $L_{X},L_{Y}$ are local events on $X$ and $Y$ respectively, then

[TABLE]

and

[TABLE]

The proof of this lemma is analogous to the proof of Lemma 9 and can be found in Appendix A.

In order to state our general result about the stabilization of the coefficients in the power series we define a notion of isomorphism between different PLUPs.

Definition 11** (PLUP isomorphism)**

We say that the PLUPs $M_{G}$ and $M_{G^{\prime}}$ are isomorphic with the fixed sets $X,X^{\prime}$ if there is a graph isomorphism $i:G\rightarrow G^{\prime}$ such that $i(X)=X^{\prime}$, moreover the probability of transitioning in one step from a state $A$ to $A^{\prime}$ is preserved under the isomorphism:

[TABLE]

and similarly the probability of initialising to a particular state $A$ is preserved:

[TABLE]

We denote such an isomorphism relation by

[TABLE]

Now we define convergent families of PLUPs. Our requirements for such a family of processes imply that the underlying graphs converge to a common graph limit, also called graphing, therefore justifying the term “convergent”. Examples of convergent families of PLUPs include DBS and CP on toruses of any dimension, when the limit graphing is just the infinite grid. Less regular examples are also included, such as toroid ladder graphs or discrete Möbius strips of fixed width.

Definition 12** (Convergent family of PLUPs)**

We say that family $\{(M_{G_{j}},v_{j})\colon j\in\mathbb{N}\}$ of rooted PLUPs is convergent, if for all $d\in\mathbb{N}$ and for all $j,k\geq d$ we have $M_{\Gamma_{G_{j}}\left(\{v_{j}\},d\right)}\underset{v_{k}}{\overset{v_{j}}{\simeq}}M_{\Gamma_{G_{k}}\left(\{v_{k}\},d\right)}$.

We are ready to state our generic result about the stabilization of coefficients phenomena.

Theorem 13** (Power series stabilization)**

Suppose that $\{(M_{G_{j}},v_{j})\colon j\in\mathbb{N}\}$ is a convergent family of rooted PLUPs, then the coefficients of the power series of $R_{G_{i}}=\mathbb{E}_{G_{i}}(\#\textsc{Asel}\left(v_{i}\right))$ stabilize. In particular, $R_{G_{i}}(p)=R_{G_{j}}(p)+\mathcal{O}(p^{\min(i,j)+1})$

Note that for translation invariant graphs, this implies $R_{G_{i}}=\frac{1}{|G_{i}|}\mathbb{E}_{G_{i}}(\text{total steps})$ stabilizes. **Proof. ** Let $d=\min(i,j)$, then

[TABLE]

In Claim 20 in Appendix B, we prove that these types of sums are absolutely convergent for small enough $p$. Therefore the equality holds when the left- and right-hand side are considered as a power series in $p$. $\Box$

3 The discrete Bak-Sneppen process

In Section 1.1 we introduced two quantities that exhibit a phase transition in the DBS process. We saw that the coefficients of their power series stabilize. In this section we will look at them in more detail.

3.1 Notation

We denote by $M_{G}$ the DBS process on the graph $G=(V,E)$. With a slight abuse of notation we also denote by $M_{G}$ the leaking transition matrix of this time-independent Markov Chain, where the row and column that correspond to the all-inactive configuration is set to zero. We will index vectors (and matrices) by sets $A\subseteq V$, where $A$ is the set of active vertices, as in Section 2. We will denote probability row vectors by $\rho\in\mathbb{R}^{2^{n}}$ so that $\rho\cdot M_{G}$ is the state of the system after one time step. Setting the all-inactive row and column to zero corresponds to the property that for every $A\subseteq V$ we have $(M_{G})_{\emptyset,A}=(M_{G})_{A,\emptyset}=0$. We will use notation $M_{(n)}$ for the process on the cycle of length $n$ and $M_{[n]}$ for the process on the chain (not periodic) of length $n$. In both case we identify vertices with $V:=[n]=\{1,2,...,n\}$.

3.2 Expected number of resamples per site

The first quantity of interest is the expected number of steps per vertex to reach the all-inactive state. Consider the DBS process on the cycle of length $n$. We start the process by letting each vertex be active with probability $p$ and inactive with probability $1-p$, independently for each vertex. Denote this initial state by $\rho^{(0)}$, so $\rho^{(0)}_{A}=p^{|A|}(1-p)^{n-|A|}$. Let $J$ be a vector with all entries equal to 1, except for the entry of the all-inactive state which is zero. Then $\rho^{(0)}\cdot M_{(n)}^{k}\cdot J^{T}$ is the probability that the all-inactive state has not been reached in $k$ steps, starting from $\rho^{(0)}$. Now define $R_{(n)}(p)$ as the expected number of steps per vertex, before reaching the all-inactive state:

[TABLE]

where $P_{(n)},P^{\prime}_{(n)}$ are polynomials as can be seen by using Cramer’s rule for matrix inversion. Therefore we can conclude that $R_{(n)}(p)$ is a rational function. For small $n$ we can compute the functions $R_{(n)}(p)$ by symbolic matrix inversion, which is how we obtained the coefficients in Table 1. For $n\geq 9$ we computed the matrix inversion for rational values of $p$ exactly, and then computed the rational function using Thiele’s interpolation formula.

3.2.1 The power-series of $R_{(n)}(p)$

As we have seen in the previous subsection, $R_{(n)}(p)$ is a rational function. Since a rational function is analytic, and $R_{(n)}(p)$ has no pole at $p=0$ (it actually takes value [math]), we can write it as

[TABLE]

where the (non-zero) radius of convergence of the above power series equals the absolute value of the closest pole of $R_{(n)}(p)$ to [math]. In order to get some intuition about the radius of convergence we plotted the location of the poles of $R_{(n)}(p)$ on the complex plane in Figure 3. For $n=10$ there is a pole at a point with absolute value $\approx 0.9598$, hence $R_{(10)}(p)$ has a radius of convergence strictly smaller than $1$ even though the rational function $R_{(n)}(p)$ is well-defined for all $p\in[0,1)$.

As was shown in Section 1.1, Table 1, the coefficients $a^{(n)}_{k}$ stabilize as $n$ grows. This is proven by Theorem 13, since the family of DBS processes on the cycles, indexed by $n$, is a convergent familiy of PLUPs. The theorem only guarantees the stabilization for $n>2k$ since going from a cycle of size $n$ to $n+1$ adds a vertex at a distance $n/2$ to any fixed vertex. In the table, however, we saw that the stabilization already holds for $n\geq k+1$. In Appendix D we prove this more precise version of the stabilization that holds for cycles. We define the ‘stabilized’ coefficients $a^{(\infty)}_{k}=a^{(k+1)}_{k}$. We then define $R_{\mathbb{Z}}(p)=R_{(\infty)}(p)=\sum_{k=0}^{\infty}a^{(\infty)}_{k}p^{k}$ and make the following conjecture.

Conjecture 14** (Radius of convergence)**

The radius of convergence of $R_{(\infty)}(p)$ is equal to the critical probability $p_{c}$ of the DBS process.

In Appendix B we explain a method to compute coefficients of the $R_{(\infty)}(p)$ power series (see the text below Claim 19). As an application, we can apply known methods of series analysis. For example, Figure 4 shows estimates for $p_{c}$ using the ratio method and the Padé approximant method. For details on these methods, see for example [HB73]. The ratio method can be used to estimate the critical value when the singularity that determines the radius of convergence is at $p_{c}$, i.e. there are no other singularities closer to the origin, which is what we assume in Conjecture 14. The figure also shows estimates based on the power-series coefficients of the functions $T_{\mathbb{N}}$ and $S_{\mathbb{Z}}$. The function $T_{\mathbb{N}}$ is the expected number of total steps on a chain with one end, with a single active vertex at that end as a starting state. This series is included because we can compute more terms for it. The function $S_{\mathbb{Z}}$ is the probability of survival on the infinite line with a single active vertex as a starting state. This is a series in $q=1-p$ and it is included because other work studies the equivalent function for the contact process and this allows for comparison of critical exponents [Dic89]. The Padé approximant method suggests that the critical value is $p_{c}\approx 0.63523\pm 0.00005$ and that the critical exponent for $S_{\mathbb{Z}}(q)\overset{q\uparrow q_{c}}{\sim}(q_{c}-q)^{\beta}$ is $\beta\approx 0.277$, which suggests that it is in the directed-percolation (DP) universality class alongside several variants of the contact process [Dic89, Inu95, TIK97].

3.3 Reaching one end of the chain from the other

Another quantity we considered in Section 1.1 is the probability of ever activating one end point of a finite chain, when we start the process with only a single active vertex at the other end. Let us consider the length-$n$ chain, and suppose we start the DBS process with a single active vertex at site $1$. As in Equation (2), we consider

[TABLE]

Note that in order to satisfy property (i) of the PLUP definition, the initial state needs to be $\{1\}$ with probability $p$ and $\emptyset$ with probability $1-p$. To get the above definition of $S_{[n]}(p)$ with a deterministic starting state one can then simply divide by $p$. The power-series coefficients of $S_{[n]}(p)$ stabilize, which follows from Lemma 9 by letting $X=\{n\}$ and $Y=\{1\}$. However, as suggested by Figure 1, the limiting power series around $p=0$ will become the zero function and it is therefore not so interesting. Instead, we can take the power series centered around $p=1$ and it turns out that also there the coefficients stabilize. We prove this below. Define $q=1-p$.

Similarly to what we did for $R_{(n)}(p)$ we can write $S_{[n]}(q)$ using a matrix inverse. We will start the process in the (deterministic) state with a single active vertex at location 1, denoted by the probability vector $\delta_{\{1\}}$. Define $\mathcal{A}_{n}=\{A\subseteq[n]\mid n\in A\}$, the set of all states where vertex $n$ is active. Let $M_{[n]}$ be the transition matrix for the DBS process on the chain of length $n$. Define the matrix $\tilde{M}_{[n]}$ as $M_{[n]}$ but with some entries set to zero. Set the row and column of the all-inactive state $\emptyset$ to zero, $(\tilde{M}_{[n]})_{A,\emptyset}=(\tilde{M}_{[n]})_{\emptyset,A}=0$ for all $A\subseteq[n]$. Furthermore set all rows $A\in\mathcal{A}_{n}$ to zero: $(\tilde{M}_{[n]})_{A,A^{\prime}}=0$ for all $A^{\prime}\subseteq[n]$. That is, whenever vertex $n$ is active there is no outgoing transition. Denote by {\mathchoice{\raisebox{0.0pt}{\displaystyle\chi}}{\raisebox{0.0pt}{\textstyle\chi}}{\raisebox{0.0pt}{\scriptstyle\chi}}{\raisebox{0.0pt}{\scriptscriptstyle\chi}}}_{\!\mathcal{A}_{n}} the vector that is 1 for all $A\in\mathcal{A}_{n}$ and zero everywhere else. We have

[TABLE]

With the same argument as before we see that $S_{[n]}$ must be a fraction of two polynomials in $p$ (and also in $q$). The poles of $S_{[n]}$ are shown in Figure 5 where $S_{[n]}$ is considered a function of $p$ to be comparable with $R_{(n)}(p)$. The coefficients $b^{[n]}_{k}$ of the $q$ power series are shown in Table 2.

Claim 15

The coefficients $b^{[n]}_{k}$ of the power series of $S_{[n]}(q)$ in Equation (10) stabilize.

**Proof. ** Let $\mathrm{RI}^{(\{n\})}$ and its complement $\mathrm{BA}^{(\{n\})}$ be as defined in Definition 3. In the following we assume that the starting state is $\{1\}$ with probability $p$ and $\emptyset$ with probability $1-p$, so the process is a PLUP. We have $S_{[n]}(p)=\frac{1}{p}\cdot\mathbb{P}(\mathrm{BA}^{(n)})$, since $S_{[n]}(p)$ has a deterministic starting state. By Lemma 7 we have $\mathbb{P}_{[n]}(\mathrm{RI}^{(\{n-1\})})=\mathbb{P}_{[n-1]}(\mathrm{RI}^{(\{n-1\})})$. Consider $1-pS_{[n]}$, i.e. the probability that the $n$-th vertex is not activated. We have

[TABLE]

Note that for the event $(\mathrm{BA}^{(\{n-1\})}\cap\mathrm{RI}^{(\{n\})})$ to hold, all vertices $1,...,n-1$ must have been active. Since the process terminates with probability 1, this means all those vertices must also have been deactivated at least once. In the DBS process a deactivation is $\mathcal{O}(q)$, so every terminating path of the Markov Chain that is in this set has a factor of at least $q^{n-1}$ associated to it, hence $\mathbb{P}_{[n]}(\mathrm{BA}^{(\{n-1\})}\cap\mathrm{RI}^{(\{n\})})=\mathcal{O}(q^{n-1})$. Here we use the absolute convergence of certain power series in $q$, which we prove in Claim 23 in Appendix C. We see that $S_{[n]}(q)-S_{[n-1]}(q)=\mathcal{O}(q^{n-1})$ so the coefficients stabilize. $\Box$

Appendix A Decay of correlations

Recall Corollary 10.

See 10

**Proof. ** First observe that if $d(X,Y)=\infty$, it means that either $X$ and $Y$ are in different connected components of $G$, or one of them is the empty set, therefore $L_{X}$ and $L_{Y}$ are independent events, so the statement holds.

Note that due to Property (i) the only path which has a non-zero constant term is the trivial path, when every vertex is initialized as inactive, thus the constant term of the probability of any local event is either [math] or $1$. Also the constant term of $\mathbb{P}_{G}(L_{X}\cap L_{Y})$ is $1$ if and only if the constant terms of both $\mathbb{P}_{G}(L_{X})$ and $\mathbb{P}_{G}(L_{Y})$ are $1$, which concludes the $d(X,Y)=0$ case.

Note that by De Morgan’s law, (6) is equivalent with

[TABLE]

Now we proceed by induction on $d(X,Y)$. Assume (5)-(6) hold for $d(X,Y)=d-1$. We will prove the statement for $d(X,Y)=d$. We apply a similar idea as in the proof of Lemma 9. Define

[TABLE]

When $L_{X}^{i}$ holds, everything at distance $i$ remains inactive, but for all distances $j\leq i-1$ there exist vertices that become active at that distance. These events form a partition $L_{X}=\dot{\bigcup}_{i\in[d]}L_{X}^{i}$, and similarly for $L_{Y}^{i}$. Below we depict $L_{X}^{i}\cap L_{Y}^{j}$ graphically.

We will show the inductive step for both (5)-(6) at the same time, for which we introduce a number $c$ such that $c=1$ if $L_{X}=\mathrm{BA}^{(X)}$ and $L_{Y}=\mathrm{BA}^{(Y)}$, and $c=-1$ otherwise. By Lemma 8

[TABLE]

for any graph on which the events are defined. Since the events form a partition, we have

[TABLE]

so it is sufficient to prove the statement for each $i,j$ separately, i.e. we want to show

[TABLE]

When $i+j-1\geq d$ then its trivial by (12). Now fix $i,j$ such that $i+j\leq d$ and define $G^{i,j}_{\mathrm{rest}}:=G\setminus\left(\;\Gamma(X,i-1)\cup\Gamma(Y,i-1)\;\right)$, as indicated in the diagram. The $\mathrm{RI}^{(..)}$ events split the graph in three parts, so we have

[TABLE]

$\Box$

Appendix B Absolute convergence

Recall Lemma 8.

See 8

The proof requires the regrouping of terms in an infinite sum. In this section we prove the absolute convergence of certain series that allows for this regrouping. We start with some notation.

Definition 16** (Paths)**

Define a path of length $k$ as an initialization and sequence of $k$ updates, where we only count steps in which an active vertex was selected. We write a path $\xi$ as

[TABLE]

Here $v_{i}$ denotes the vertex that was selected in the $i$-th step and $R_{i}\subseteq\Gamma(v_{i})$ is the result of the corresponding update that happened afterwards. After $t$ steps, the state of the process is $A_{t}=(A_{t-1}\setminus\Gamma(v_{t}))\cup R_{t}$. We say a path is terminating if $A_{k}=\emptyset$. Denote by $\textsc{paths}_{A,k}$ the set of all paths $\xi$ that initialize to $A$ and have length $k$. Denote by $\textsc{tpaths}_{A,k}$ the set of all terminating paths that initialize to $A$ and have length $k$.

We have $\textsc{tpaths}_{A,k}\subseteq\textsc{paths}_{A,k}$. Any local event is a collection of terminating paths121212Up to the zero probability event of non-termination., and

[TABLE]

For a general PLUP we have $\mathbb{P}(\xi)=\mathbb{P}(A_{0})\mathbb{P}((v_{1},R_{1})\mid A_{0})\mathbb{P}((v_{2},R_{2})\mid A_{1})\cdots\mathbb{P}((v_{k},R_{k})\mid A_{k-1})$ where the polynomial $\mathbb{P}(A_{0})$ is the probability of starting in state $A_{0}$ and $\mathbb{P}((v_{t},R_{t})\mid A_{t-1})$ are polynomials satisfying property (iii) of the PLUP definition. For the DBS process these polynomials take the specific form $\mathbb{P}(\xi)=\mathbb{P}(A_{0})Z_{\xi}p^{|R_{1}|+...+|R_{k}|}(1-p)^{3k-|R_{1}|+...+|R_{k}|}$ where $Z_{\xi}$ is some $p$-independent factor.

Definition 17** (Polynomials)**

Let $Q(p)=a_{m}p^{m}+a_{m+1}p^{m+1}+...+a_{M}p^{M}$ be a polynomial where $a_{m}\neq 0$ and $a_{M}\neq 0$. Define $\mathrm{mindeg}(Q(p))=m$, $\mathrm{maxdeg}(Q(p))=M$ and define by $\left\lVert Q\right\rVert_{\mathrm{abs}}$ the polynomial obtained by taking the absolute values of the coefficients:

[TABLE]

By the triangle inequality $\left\lVert f\cdot g\right\rVert_{\mathrm{abs}}(p)\leq\left\lVert f\right\rVert_{\mathrm{abs}}(p)\cdot\left\lVert g\right\rVert_{\mathrm{abs}}(p)$ for any polynomials $f,g$.

Claim 18

The polynomials $\mathbb{P}(\textsc{paths}_{A,k})$, $\mathbb{P}(\textsc{tpaths}_{A,k})$ and $\mathbb{P}(\xi)$ for any $\xi\in\textsc{paths}_{A,k}$ all satisfy

[TABLE]

Here $0<c<c^{\prime}$ are constants depending on the particular process and $\mathbb{P}(A)$ is the probability of starting in state $A$ (a polynomial).

**Proof. ** Note that

[TABLE]

is a sum over finitely many polynomials. It is sufficient to prove the statement for each $\xi$ and it then follows for the sum. Since $\textsc{tpaths}_{A,k}\subseteq\textsc{paths}_{A,k}$ it also follows for $\mathbb{P}(\textsc{tpaths}_{A,k})$. Let $\xi$ be a path as described in Definition 16. As stated in the text below Definition 16 we have $\mathbb{P}(\xi)=\mathbb{P}(A_{0})\mathbb{P}((v_{1},R_{1})\mid A_{0})\mathbb{P}((v_{2},R_{2})\mid A_{1})\cdots\mathbb{P}((v_{k},R_{k})\mid A_{k-1})$ where $A_{t}\subseteq[n]$ is the state after $t$ steps and $A_{0}=A$. Let $c^{\prime}$ be the degree of the highest order term of any possible local-update step of this process (finitely many possibilities) than $\mathrm{maxdeg}(\mathbb{P}(\xi))\leq c^{\prime}\cdot k+\mathrm{maxdeg}(\mathbb{P}(A))$.

Note $\mathrm{mindeg}(\mathbb{P}(\xi))=\mathrm{mindeg}(\mathbb{P}(A))+\mathrm{mindeg}(\mathbb{P}((v_{1},R_{1})\mid A_{0}))+\cdots+\mathrm{mindeg}(\mathbb{P}((v_{k},R_{k})\mid A_{k-1}))$. If $|A_{t}|-|A_{t-1}|\geq 0$ then either $A_{t}=A_{t-1}$ or $|A_{t}\setminus A_{t-1}|>0$. By property (iii) of the PLUP definition we therefore have that $|A_{t}|-|A_{t-1}|\geq 0$ implies $\mathrm{mindeg}(\mathbb{P}((v_{t},R_{t})\mid A_{t-1}))\geq 1$. Furthermore, $|A_{t}|-|A_{t-1}|\leq d_{\mathrm{max}}$ where $d_{\mathrm{max}}$ is the maximum degree of the vertices in $G$. Therefore we have

[TABLE]

Summing both sides over $t$ we obtain $\mathrm{mindeg}(\mathbb{P}(\xi))-\mathrm{mindeg}(\mathbb{P}(A))\geq\frac{1}{d_{\mathrm{max}}+1}(k+|A_{k}|-|A|)$. This proves the claim with $c=\frac{1}{d_{\mathrm{max}}+1}$. $\Box$

For the DBS process, in the context of Section 3.2, we can slightly refine the above claim.

Claim 19

Let $\rho^{(0)}$, $M_{(n)}$ and $J$ be as defined in Section 3.2. The polynomial $\rho^{(0)}\cdot M_{(n)}^{k}\cdot J^{T}=\sum_{A\subseteq[n]}\mathbb{P}(\textsc{paths}_{A,k})$ in $p$ has lowest-order term at least $p^{k}$ and highest-order term at most $p^{n+3k}$.

**Proof. ** We repeat the proof of Claim 18. Note that $\mathrm{mindeg}(\mathbb{P}((v_{t},R_{t})\mid A_{t-1}))\geq 1+|A_{t}|-|A_{t-1}|$ for the DBS process, so $c=1$. For DBS, $c^{\prime}=3$ which is the maximum degree of the local update rule ($p^{3}$ occurs when all three resampled vertices become active). The claim then follows by noting that $\mathbb{P}(A)=p^{|A|}(1-p)^{n-|A|}$ in the starting state $\rho^{(0)}$. $\Box$

This claim is convenient for the computation of the $R_{(n)}(p)$ power series. It implies that the term $p^{j}$ is only present in those polynomials $\rho^{(0)}\cdot M_{(n)}^{k}\cdot J^{T}$ for which $\lceil\frac{j-n}{3}\rceil\leq k\leq j$. To compute the power-series coefficient $a^{(n)}_{j}$ it is sufficient to consider this finite set of polynomials. In other words, in order to compute $R_{(n)}(p)$ up to $k$-th order in $p$, it suffices to consider only the first $k$ steps of the DBS process. We use this observation to compute the coefficients of the $n\geq 18$ series by computing matrix powers symbolically in $p$, see Table 1.

Claim 20

There is a constant $\delta>0$ such that, for any polynomial $f(k)$, the following series is absolutely convergent for $p\in[0,\delta]$:

[TABLE]

Note that the sum is over all paths, not only the terminating ones.

**Proof. ** We have $\mathbb{P}(\xi)=\mathbb{P}(A_{0})\mathbb{P}((v_{1},R_{1})\mid A_{0})\mathbb{P}((v_{2},R_{2})\mid A_{1})\cdots\mathbb{P}((v_{k},R_{k})\mid A_{k-1})$. The polynomials $P_{t}:=\mathbb{P}((v_{t},R_{t})\mid A_{t-1})$ come from a finite set of polynomials: for each vertex $v$ there are at most $2^{|\Gamma(v)|}$ possible updates and there are at most $n$ vertices. Therefore there is a constant $C$ such that for all these polynomials

[TABLE]

By Claim 18 there is a $c$ such that

[TABLE]

There are at most $(2^{d_{\mathrm{max}}}n)^{k}$ paths of length $k$ for a fixed starting state so we have

[TABLE]

Since there are finitely many ($2^{n}$) starting states $A$, the whole expression is absolutely convergent for $p<\left(2^{d_{\mathrm{max}}}nC\right)^{-1/c}$. $\Box$

Since any local event is a subset of the set of all terminating paths, the powerseries for any event is also absolutely convergent. This yields the following corollaries.

Corollary 21

Let $E$ be an event such that $\mathbb{P}(\xi)=\mathcal{O}(p^{k})$ for all paths $\xi\in E$. Then $\mathbb{P}(E)=\mathcal{O}(p^{k})$.

**Proof. ** For $p\in[0,\delta]$ we have $\mathbb{P}(E)=\sum_{j=k}^{\infty}a_{j}p^{j}$ by Claim 20. By uniqueness of power series, this equality holds for all $p$ up to the radius of convergence. $\Box$

Corollary 22

Let $A_{0}\subseteq[n]$ be any state and let $E$ be an event such that for all paths $\xi\in E$ we have $\mathbb{P}(\xi\mid\text{start }A_{0})=\mathcal{O}(p^{k})$. Then $\mathbb{P}(E\mid\text{start }A_{0})=\mathcal{O}(p^{k})$.

**Proof. ** The proofs of Claim 20 and Corollary 21 also hold when everything is conditioned on a fixed starting state $A_{0}\subseteq[n]$. The sum over $A$ and the factors $\left\lVert\mathbb{P}(A)\right\rVert_{\mathrm{abs}}$ are simply removed from the equations. $\Box$

Appendix C Absolute convergence for the $q$ power series

We now turn our attention to the $S_{[n]}(q)$ series defined in Equation (10). This process starts with a single active vertex at position $1$, i.e. $A=\{1\}$, and we look at the probability that vertex $n$ is never activated, $\mathbb{P}(\mathrm{RI}^{(\{n\})}\mid\text{start }A)$, as a function of $q=1-p$. To prove the absolute convergence of such series for general PLUPs we require more properties than the definition of PLUP that we have. We now consider the update polynomials as a function of $q=1-p$. The update rule for a single time step should satisfy the following two properties.

• •

When $q=0$ then the probability that an active vertex becomes inactive is zero.

This implies that any inactivation is $\mathcal{O}(q)$.

• •

There is a $c>0$ such that if $q=0$ then: for all vertices $v$ with an active neighbor, the probability of activating $v$ when that neighbor is selected is at least $c$.

These properties are satisfied by the CP and DBS process.

Claim 23

Consider a PLUP that satisfies the above two properties. Let $X\subset V$ be any subset of vertices such that its boundary $B=\bar{\partial}(X;1)$ is not empty. Let the starting state be $A\subseteq X$. Then the following series converges for small enough $q$

[TABLE]

Therefore one can regroup terms in the series $\mathbb{P}(\mathrm{RI}^{(B)})=\sum_{k\geq 0}\sum_{\xi\in\textsc{tpaths}_{A,k}\cap\mathrm{RI}^{(B)}}\mathbb{P}(\xi)(q)$.

**Proof. ** Let $Q_{i,j}(q)$ be the $j$-th transition polynomial for vertex $i$, so that $\sum_{j}Q_{i,j}(q)=1$. (In case of the DBS process these are of the form $q^{a}(1-q)^{b}$ and independent of which vertex is being resampled.) Since this holds for $q=0$, the constant terms of $Q_{i,j}(q)$ are non-negative and sum to 1. Hence we have $\sum_{j}\left\lVert Q_{i,j}\right\rVert_{\mathrm{abs}}(q)=1+\mathcal{O}(q)$. Define new normalized functions $\tilde{Q}_{i,j}(q)=\frac{\left\lVert Q_{i,j}\right\rVert_{\mathrm{abs}}(q)}{\left(\sum_{j}\left\lVert Q_{i,j}\right\rVert_{\mathrm{abs}}(q)\right)}$ and consider the same process but with the transition polynomials $Q_{i,j}(q)$ replaced by the functions $\tilde{Q}_{i,j}(q)$. Whenever $Q_{i,j}(q)=\mathcal{O}(q)$ then also $\tilde{Q}_{i,j}(q)=\mathcal{O}(q)$.

By the second additional property there is a $c$ such that any neighbor of an active vertex can be activated with probability at least $c$ when $q=0$, so the constant term in the corresponding transition polynomials is at least $c$. When taking the absolute polynomials $\left\lVert Q_{i,j}\right\rVert_{\mathrm{abs}}(q)$ this also holds for non zero $q$. The functions $\tilde{Q}_{i,j}(q)$ are then at least $(c+\mathcal{O}(q))/(1+\mathcal{O}(q))$ so there is a $q_{0}>0$ such that $\tilde{Q}_{i,j}(q)\geq c^{\prime}=c/2$ for all $0\leq q\leq q_{0}$.

Define the following random variables. Let $I^{B}_{i}\in\{0,1\}$ be 1 if any active vertex got inactivated in step $i$ or if the process has terminated or if a vertex in $B$ has been active at some point before step $i$. Let $G^{B}_{i}\in\{0,1\}$ be 1 if any inactive vertex got activated in step $i$ or if the process has terminated or if a vertex in $B$ has been active at some point before step $i$. Let $I^{B}_{\leq k}=\sum_{i=1}^{k}I^{B}_{i}$ and $G^{B}_{\leq k}=\sum_{i=1}^{k}G^{B}_{i}$. We always have $G^{B}_{\leq k}\leq|X|+I^{B}_{\leq k}$ since after $|X|$ activations any other activation requires an inactivation first.

Define $s=\frac{\min_{v\in V}w_{v}}{\sum_{v\in V}w_{v}}$ where the $w_{v}$ are the selection weights of the PLUP. (For the DBS process $s=\frac{1}{n}$). This is unchanged in the process with the $\tilde{Q}_{i,j}(q)$ transition functions. Now we show that

Claim 24

The random variable $G^{B}_{\leq k}$ satisfies

[TABLE]

**Proof. ** By definition, if there are no active or no inactive vertices in step $i$ then $G^{B}_{i}=1$. If there are, then an active vertex with inactive neighbor is picked with probability at least $s$ (this holds for both the original process and the process with $\tilde{Q}_{i,j}(q)$ transition functions) and the neighbor is then activated with probability at least $c^{\prime}$. Therefore we have $\tilde{\mathbb{P}}(G^{B}_{i}=1)\geq s\cdot c^{\prime}>0$.

Define $k$ i.i.d. Bernoulli variables $C_{i}$ with success probability $s\cdot c^{\prime}$ and $C=\sum_{i=1}^{k}C_{i}$. The expectation of $C$ is $\mathbb{E}(C)=sc^{\prime}k$ and using the Chernoff bound we can bound the probability that $C$ deviates far from its mean:

[TABLE]

We use a coupling argument to compare the $G^{B}_{i}$ variables with the $C_{i}$’s. Let $U_{i}$ be i.i.d. uniform $[0,1]$ variables. Define $C_{i}$ to be $1$ if $U_{i}<sc^{\prime}$ so the $C_{i}$’s are indeed i.i.d. Bernoulli variables with the correct distribution.

The probability $\mathbb{P}(G^{B}_{i}=1)$ depends on the history of the process. Run the process and in each step of the process, first compute the true probability $p_{i}=\mathbb{P}(G^{B}_{i}=1\mid\text{history})$, so $p_{i}>sc^{\prime}$. Now instead of running the process normally, define $G^{B}_{i}=1$ if and only if $U_{i}<p_{i}$. Then continue the process conditioned on the value of $G^{B}_{i}$ so it follows the normal distribution. This way, the $G^{B}_{i}$ variables come from the correct distribution but they are coupled to the $C_{i}$’s. We see $C_{i}=1$ implies $G^{B}_{i}=1$ so $G^{B}_{\leq k}\geq C$ and therefore the Chernoff bound applies to $G^{B}_{\leq k}$ as well. $\Box$

Now we continue the proof of Claim 23.

By the first property every inactivation has an update step that is $\mathcal{O}(q)$ (even with the $\tilde{Q}_{i,j}$ functions). Every path of length $k$ has $I^{B}_{\leq k}$ inactivations so has probability $\mathcal{O}(q)^{I^{B}_{\leq k}}$. Let $T_{k}$ be the event that the process takes exactly $k$ steps. For the “tilde process” we have

[TABLE]

Note that the constants in all big-O parts are independent of the number of steps. We have

[TABLE]

This is convergent for small enough $q$. $\Box$

Appendix D Proving that $a_{k}^{(k+1)}=a_{k}^{(n)}$ for all $n>k$

In the main text we looked at $R_{(n)}(p)$ and saw that the coefficients of this series stabilize. Our main theorem, however, only shows that this stabilization happens for $n>2k$ since any new vertex added by going from $n$ to $n+1$ is at distance at most $n/2$ from all existing vertices. In this section we prove the stronger statement, namely that the coefficients stabilize for $n>k$. Let

[TABLE]

be the event that every vertex in $C$ becomes active, and the boundary remains inactive. If $P_{C}$ holds, we say $C$ is a patch of the activations.

The intuition of the following theorem is similar to that of Corollary 10. A site can only realize the length of the cycle after an interaction chain was formed around the cycle, implying that every vertex was activated at least once.

Theorem 25

$R_{(n)}=\mathbb{E}_{[-m,m]}(\#\textsc{Asel}\left(0\right))+\mathcal{O}(p^{n})$* for all $m\geq n\geq 3$, thus $R_{(n)}-R_{(m)}=\mathcal{O}(p^{n})$.*

**Proof. ** In the proof we identify the sites of the $n$-cycle with the$\mod n$ remainder classes. We have $R_{(n)}(p)=\mathbb{E}_{(n)}(\#\textsc{Asel}\left(0\right))$ by translation invariance, and this expectation is equal to $\sum_{k=1}^{\infty}\mathbb{P}_{(n)}(\#\textsc{Asel}\left(0\right)\!\geq\!k)$. We will now rewrite $X=\mathbb{P}_{(n)}(\#\textsc{Asel}\left(0\right)\!\geq\!k)$.

[TABLE]

We conclude the proof by observing

[TABLE]

$\Box$