Fast sequential creation of random realizations of degree sequences
From MaRDI portal
Recommendations
- A Sequential Algorithm for Generating Random Graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A sequential algorithm for generating random graphs
- Fast uniform generation of random graphs with given degree sequences
- Efficient and simple generation of random simple connected graphs with prescribed degree sequence
Cites work
- scientific article; zbMATH DE number 3720966 (Why is no real title available?)
- scientific article; zbMATH DE number 3760216 (Why is no real title available?)
- A Sequential Algorithm for Generating Random Graphs
- A note on a theorem of Erdős and Gallai
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Algorithms for constructing graphs and digraphs with given valences and factors
- Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs
- Confirming two conjectures about the integer partitions
- Degree sequences and majorization
- Longest chains in the lattice of integer partitions ordered by majorization
- Realizability and uniqueness in graphs
- Sampling Regular Graphs and a Peer-to-Peer Network
- The lattice of integer partitions
- The switch Markov chain for sampling irregular graphs (extended abstract)
- Threshold graphs and related topics
Cited in
(14)- Relaxed and approximate graph realizations
- On bipartite graph realizations of a single degree sequence
- Graph realizations: maximum degree in vertex neighborhoods
- Vertex-weighted graphs: realizable and unrealizable domains
- Vertex-weighted realizations of graphs
- On vertex-weighted realizations of acyclic and general graphs
- On the role of the equal partition in degree realization by a bipartite graph
- On vertex-weighted graph realizations
- Sampling for conditional inference on network data
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Efficient conversion of random sequences into equiprobable and independent sequences
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades
- Efficient counting of degree sequences
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
This page was built for publication: Fast sequential creation of random realizations of degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856436)
