From flip processes to dynamical systems on graphons

Frederik Garbe, Jan Hladký, Matas Šileikis +1

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 \mathca…