Rejection sampling of bipartite graphs with given degree sequence
From MaRDI portal
Recommendations
- Sampling \(k\)-partite graphs with a given degree sequence
- Sampling hypergraphs with given degrees
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Uniform sampling of bipartite graphs with degrees in prescribed intervals
- A sequential algorithm for generating random graphs
Cites work
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 1303607 (Why is no real title available?)
- scientific article; zbMATH DE number 1334601 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 795108 (Why is no real title available?)
- A critical point for random graphs with a given degree sequence
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A sequential algorithm for generating random graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- Algebraic algorithms for sampling from conditional distributions
- An Application of Markov Chain Monte Carlo to Community Ecology
- Approximating the Permanent
- Bipartite structure of all complex networks
- Combinatorial Properties of Matrices of Zeros and Ones
- Computing and Combinatorics
- Counting and selecting at random bipartite graphs with fixed degrees
- Counting the Number of r × c Contingency Tables with Fixed Margins
- Degree-based graph construction
- Fast uniform generation of regular graphs
- Line removal algorithms for graphs and their degree lists
- Markov chain algorithms for planar lattice structures
- Matrices of zeros and ones with fixed row and column sum vectors
- Random sampling of labeled tournaments
- Sampling Regular Graphs and a Peer-to-Peer Network
- Sampling contingency tables
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- The asymptotic number of labeled graphs with given degree sequences
- The structure and dynamics of networks
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Uniform generation of random regular graphs of moderate degree
Cited in
(6)- Sampling \(k\)-partite graphs with a given degree sequence
- scientific article; zbMATH DE number 7559095 (Why is no real title available?)
- Sampling hypergraphs with given degrees
- Uniform sampling of bipartite graphs with degrees in prescribed intervals
- An efficient algorithm to test potential bipartiteness of graphical degree sequences
- Towards random uniform sampling of bipartite graphs with given degree sequence
This page was built for publication: Rejection sampling of bipartite graphs with given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737401)
