





























Garbe, Hladký, Šileikis and Skerman [Ann. Inst. Henri Poincaré Probab. Stat., 60 (2024), pp. 2878-2922] recently introduced a general class of random graph processes called flip processes and proved that the typical evolution of these discrete-time random graph processes corresponds to certain continuous-time deterministic graphon trajectories. We obtain a complete characterization of the equivalence classes of flip process rules with the same graphon trajectories. As an application, we characterize the flip process rules which are unique in their equivalence classes. These include several natural families of rules such as the complementing rules, the component completion rules, the extremist rules, and the clique removal rules.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。