Rejection sampling of bipartite graphs with given degree sequence
type: Item
instance of: scholarly article
title: Rejection sampling of bipartite graphs with given degree sequence
zbMATH Open document ID: 1407.05059
author: Xianqiang Yang
published in: Acta Universitatis Sapientiae. Mathematica
publication date: 2019-03-27T00:00:00Z
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 7042985
zbMATH Keywords: degree sequence
zbMATH Keywords: contraction of a degree sequence
zbMATH Keywords: degree sequence bipartition
zbMATH Keywords: contraction of a graph
zbMATH Keywords: deletion of a graph
zbMATH Keywords: ecological occurrence matrix
MaRDI profile type: Publication
full work available at URL: ausm-2018-0020
OpenAlex ID: W2947620650
cites work: A sequential algorithm for generating random graphs
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: A sequential importance sampling algorithm for generating random graphs with prescribed degrees
cites work: Line removal algorithms for graphs and their degree lists
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: Matrices of zeros and ones with fixed row and column sum vectors
cites work: Q4012032
cites work: Sequential Monte Carlo Methods for Statistical Analysis of Tables
cites work: An Application of Markov Chain Monte Carlo to Community Ecology
cites work: Sampling Regular Graphs and a Peer-to-Peer Network
cites work: Q4845257
cites work: Algebraic algorithms for sampling from conditional distributions
cites work: Q3287781
cites work: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
cites work: Counting the Number of r × c Contingency Tables with Fixed Margins
cites work: Counting and selecting at random bipartite graphs with fixed degrees
cites work: Bipartite structure of all complex networks
cites work: Approximating the Permanent
cites work: Fast uniform generation of regular graphs
cites work: Q4262220
cites work: Sampling contingency tables
cites work: Degree-based graph construction
cites work: Markov chain algorithms for planar lattice structures
cites work: Uniform generation of random regular graphs of moderate degree
cites work: Random sampling of labeled tournaments
cites work: Towards random uniform sampling of bipartite graphs with given degree sequence
cites work: A critical point for random graphs with a given degree sequence
cites work: Q5386180
cites work: Combinatorial Properties of Matrices of Zeros and Ones
cites work: Q4250233
cites work: Computing and Combinatorics
cites work: Q4263664
Wikidata QID: Q127568941
DOI: 10.2478/AUSM-2018-0020
description: scientific article; zbMATH DE number 7042985