From flip processes to dynamical systems on graphons

Abstract

We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labeled $k$-vertex graphs into itself ($k$ is fixed). The process starts with a given $n$-vertex graph $G_0$. In each step, the graph $G_i$ is obtained by sampling $k$ random vertices $v_1,\ldots,v_k$ of $G_{i-1}$ and replacing the induced graph $F:=G_{i-1}[v_1,\ldots,v_k]$ by $\mathcal{R}(F)$. This class contains several previously studied processes including the Erdős--Rényi random graph process and the triangle removal process. Actually, our definition of flip processes is more general, in that $\mathcal{R}(F)$ is a probability distribution on $\mathcal{H}_k$, thus allowing randomised replacements. Given a flip process with a rule $\mathcal{R}$, we construct time-indexed trajectories $Φ:\mathcal{W}_0\times [0,\infty)\rightarrow\mathcal{W}_0$ in the space of graphons. We prove that for any $T > 0$ starting with a large finite graph $G_0$ which is close to a graphon $W_0$ in the cut norm, with high probability the flip process will stay in a thin sausage around the trajectory $(Φ(W_0,t))_{t=0}^T$ (after rescaling the time by the square of the order of the graph). These graphon trajectories are then studied from the perspective of dynamical systems. Among others topics, we study continuity properties of these trajectories with respect to time and initial graphon, existence and stability of fixed points and speed of convergence (whenever the infinite time limit exists). We give an example of a flip process with a periodic trajectory.