Generating constrained random graphs using multiple edge switches
From MaRDI portal
Abstract: The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily possible to access all graphs obeying some given con- straints through a classical switching procedure calling on pairs of edges. We therefore propose to get round this issue by generalizing this classical approach through the use of higher-order edge switches. This method, which we denote by "k-edge switching", makes it possible to progres- sively improve the covered portion of a set of constrained graphs, thereby providing an increasing, asymptotically certain confidence on the statistical representativeness of the obtained sample.
Recommendations
- Random graph generation using multiple switches of edges
- Constrained Markovian dynamics of random graphs
- Generating random networks without short cycles
- Switching edges to randomize networks : What goes wrong and how to fix it
- Controlled Markovian dynamics of graphs: unbiased generation of random graphs with prescribed topological properties
Cited in
(5)- Constrained Markovian dynamics of random graphs
- Firm-network characteristics and economic robustness to natural disasters
- Configuring random graph models with fixed degree sequences
- Switching edges to randomize networks : What goes wrong and how to fix it
- Random graph generation using multiple switches of edges
This page was built for publication: Generating constrained random graphs using multiple edge switches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406240)
