Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
Asymptotic enumeration by degree sequence of graphs of high degree
European Journal of Combinatorics
Combinatorics, Probability and Computing
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
A simple solution to the k-core problem
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Efficient control of epidemics over random networks
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Random graphs with forbidden vertex degrees
Random Structures & Algorithms
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Liftings of tree-structured Markov chains
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The scaling window for a random graph with a given degree sequence
Random Structures & Algorithms
SIR epidemics on random graphs with a fixed degree sequence
Random Structures & Algorithms
| Hi-index | 0.01 |
Consider a random multigraph G* with given vertex degrees d1,…,dn, constructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges , the probability that the multigraph is simple stays away from 0 if and only if . This was previously known only under extra assumptions on the maximum degree maxidi. We also give an asymptotic formula for this probability, extending previous results by several authors.