Characterization of flip process rules with the same trajectories
From MaRDI portal
Publication:6438677
arXiv2305.19925MaRDI QIDQ6438677FDOQ6438677
Authors: Eng Keat Hng 
Publication date: 31 May 2023
Abstract: Garbe, Hladk'y, v{S}ileikis and Skerman 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 correspond 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.
This page was built for publication: Characterization of flip process rules with the same trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6438677)
