Towards random uniform sampling of bipartite graphs with given degree sequence
From MaRDI portal
Publication:1953395
zbMath1266.05155arXiv1004.2612MaRDI QIDQ1953395
István Miklós, Lajos Soukup, Péter L. Erdős
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.2612
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of graph theory to circuits and networks (94C15) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (17)
Mixing time of the switch Markov chain and stable degree sequences ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Unnamed Item ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Sampling hypergraphs with given degrees ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ The mixing time of switch Markov chains: a unified approach ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Half-graphs, other non-stable degree sequences, and the switch Markov chain ⋮ Sampling \(k\)-partite graphs with a given degree sequence ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices ⋮ A triangle process on regular graphs
This page was built for publication: Towards random uniform sampling of bipartite graphs with given degree sequence
