DENSE MULTIGRAPHON-VALUED STOCHASTIC PROCESSES AND EDGE-CHANGING DYNAMICS IN THE CONFIGURATION MODEL

Time-evolving random graph models have appeared and have been studied in various fields of research over the past decades. However, the rigorous mathematical treatment of large graphs and their limits at the process-level is still in its infancy. In this article, we adapt the approach of Athreya, den Hollander and Röllin (Ann. Appl. Probab. 31 (2021) 1724–1745) to the setting of multigraphs and multigraphons, introduced by Kolossváry and Ráth (Acta Math. Hungar. 130 (2011) 1–34). We then generalise the work of Ráth (Random Structures Algorithms 41 (2012) 365–390) and Ráth and Szakács (Acta Math. Hungar. 136 (2012) 196–221), who analysed edge-flipping dynamics on the configuration model—in contrast to their work, we establish weak convergence at the process-level, and by allowing removal and addition of edges, these limits are nondeterministic.