Subgraphs of random graphs with specified degrees

103 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A new proof of Friedman's second eigenvalue theorem and its extension to random lifts (2015, methodology): “For example, it follows from McKay [24] that for n large enough, the graph contains as subgraph the complete graph with d + 1 vertices with probability at least n−c for some explicit c > 0.”
Adjacency matrices of random digraphs: singularity and anti-concentration (2015, methodology): “The simple switching was introduced (for general graphs) by Senior [31] (in that paper, it was called “transfusion”); in the context of d-regular graphs it was first applied by McKay [25].”
On the singularity of adjacency matrices for random regular digraphs (2014, methodology): “is known as the switchings method, which has been a successful tool in the study of random regular graphs since its introduction by McKay in [26]; see also section 2.”
Random Graphs and Complex Networks (2016, background): “Switching algorithms have a long history, dating back at least to McKay (1981), see also Gao and Wormald (2016); McKay and Wormald (1990), as well as McKay (2011) and the references therein for an overview.”