A Sequential Algorithm for Generating Random Graphs
From MaRDI portal
Publication:3603475
DOI10.1007/978-3-540-74208-1_24zbMATH Open1171.05423OpenAlexW2569149672MaRDI QIDQ3603475FDOQ3603475
Authors: Mohsen Bayati, Jeong Han Kim, Amin Saberi 
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8082
Recommendations
- A sequential algorithm for generating random graphs
- Fast uniform generation of random graphs with given degree sequences
- Fast uniform generation of regular graphs
- Uniform generation of random regular graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
Cited In (15)
- Random iteration algorithm for graph-directed sets
- Characterizing optimal sampling of binary contingency tables via the configuration model
- A linear-time algorithm for sampling graphs with given degrees
- A sequential algorithm for generating random graphs
- An algorithm generating random graphs with power law degree distributions
- Generating random networks without short cycles
- Rare-event simulation for neural network and random forest predictors
- Generating random regular graphs
- Efficient importance sampling for binary contingency tables
- Fast uniform generation of random graphs with given degree sequences
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Efficient generation of networks with given expected degrees
- Engineering uniform sampling of graphs with a prescribed power-law degree sequence
- Fast sequential creation of random realizations of degree sequences
- Generating graphs randomly
This page was built for publication: A Sequential Algorithm for Generating Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603475)
