Sampling k-partite graphs with a given degree sequence

DOI10.2478/AUSI-2018-0010zbMATH Open1421.05030OpenAlexW2909715706WikidataQ128631787 ScholiaQ128631787MaRDI QIDQ2326166FDOQ2326166

Authors: 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

Recommendations

• Rejection sampling of bipartite graphs with given degree sequence
• Uniform generation of random regular graphs of moderate degree
• A sequential algorithm for generating random graphs
• Fast uniform generation of random graphs with given degree sequences
• Sampling hypergraphs with given degrees

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Markov chain algorithms for planar lattice structures
• The structure and dynamics of networks
• Title not available (Why is that?)
• Matrices of zeros and ones with fixed row and column sum vectors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic algorithms for sampling from conditional distributions
• Approximating the Permanent
• The asymptotic number of labeled graphs with given degree sequences
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• An Application of Markov Chain Monte Carlo to Community Ecology
• Title not available (Why is that?)
• Sampling Regular Graphs and a Peer-to-Peer Network
• A sequential algorithm for generating random graphs
• Towards random uniform sampling of bipartite graphs with given degree sequence
• Rejection sampling of bipartite graphs with given degree sequence

Cited In (5)

• Rejection sampling of bipartite graphs with given degree sequence
• Constructing and sampling directed graphs with given degree sequences
• An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
• An efficient algorithm to test potential bipartiteness of graphical degree sequences
• Sampling hypergraphs with given degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326166)