Name
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 constraints through a classical switching procedure calling on pairs of edges. Therefore, we propose to get around 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 progressively 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/1963190.2063515 | Clinical Orthopaedics and Related Research |
Keywords | DocType | Volume |
random graph,random sample,asymptotically certain confidence,k-edge switching,covered portion,edge switching,edge swap,markov-chain mixing,classical approach,graph algorithms,constrained graphs,reliable method,higher-order edge,random graphs,multiple edge,classical switching procedure,markov chain,degree distribution,higher order,random sampling | Journal | 16, |
Citations | PageRank | References |
6 | 0.59 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lionel Tabourier | 1 | 90 | 8.85 |
| Camille Roth | 2 | 109 | 7.42 |
| Jean-Philippe Cointet | 3 | 113 | 12.20 |