Rejection sampling of bipartite graphs with given degree sequence
From MaRDI portal
Publication:1737401
DOI10.2478/ausm-2018-0020zbMath1407.05059OpenAlexW2947620650WikidataQ127568941 ScholiaQ127568941MaRDI QIDQ1737401
Publication date: 27 March 2019
Published in: Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausm-2018-0020
degree sequencecontraction of a degree sequencecontraction of a graphdegree sequence bipartitiondeletion of a graphecological occurrence matrix
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sequential algorithm for generating random graphs
- Fast uniform generation of regular graphs
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- Matrices of zeros and ones with fixed row and column sum vectors
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Sampling contingency tables
- Algebraic algorithms for sampling from conditional distributions
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Random sampling of labeled tournaments
- Bipartite structure of all complex networks
- Markov Chain Algorithms for Planar Lattice Structures
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Approximating the Permanent
- Combinatorial Properties of Matrices of Zeros and Ones
- Counting and selecting at random bipartite graphs with fixed degrees
- Uniform generation of random regular graphs of moderate degree
- An Application of Markov Chain Monte Carlo to Community Ecology
- Degree-based graph construction
- Line removal algorithms for graphs and their degree lists
- Counting the Number of r × c Contingency Tables with Fixed Margins
- A critical point for random graphs with a given degree sequence
- Sampling Regular Graphs and a Peer-to-Peer Network
- Computing and Combinatorics
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
This page was built for publication: Rejection sampling of bipartite graphs with given degree sequence
