Sampling \(k\)-partite graphs with a given degree sequence

DOI10.2478/ausi-2018-0010zbMath1421.05030OpenAlexW2909715706WikidataQ128631787 ScholiaQ128631787MaRDI QIDQ2326166

Yanyan Li

Publication date: 7 October 2019

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2018-0010

zbMATH Keywords

degree sequencecontraction of a degree sequencecontraction of a graphdegree sequence bipartitiondeletion of a graphecological occurrence matrix

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequential algorithm for generating random 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
• Rejection sampling of bipartite graphs with given degree sequence
• Algebraic algorithms for sampling from conditional distributions
• Towards random uniform sampling of bipartite graphs with given degree sequence
• Markov Chain Algorithms for Planar Lattice Structures
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Approximating the Permanent
• An Application of Markov Chain Monte Carlo to Community Ecology
• Sampling Regular Graphs and a Peer-to-Peer Network
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: Sampling \(k\)-partite graphs with a given degree sequence