Sampling Regular Graphs and a Peer-to-Peer Network

From MaRDI portal
Publication:5437233

DOI10.1017/S0963548306007978zbMath1137.05065arXiv1203.6111OpenAlexW2167223378WikidataQ56323873 ScholiaQ56323873MaRDI QIDQ5437233

Colin Cooper, Martin Dyer, Catherine Greenhill

Publication date: 18 January 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.6111




Related Items

Sampling Edge Covers in 3-Regular GraphsMixing time of the switch Markov chain and stable degree sequencesA sequential algorithm for generating random graphsExpansion and flooding in dynamic random networks with node churnFast uniform generation of random graphs with given degree sequencesSharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphsUnnamed ItemApproximate sampling of graphs with near-\(P\)-stable degree intervalsUnnamed ItemThe switch Markov chain for sampling irregular graphs and digraphsSampling contingency tablesA survey of discrete methods in (algebraic) statistics for networksSwitch-based Markov chains for sampling Hamiltonian cycles in dense graphsThe flip Markov chain for connected regular graphsExpansion properties of a random regular graph after random vertex deletionsConstructing and sampling directed graphs with given degree sequencesRejection sampling of bipartite graphs with given degree sequenceSampling hypergraphs with given degreesExact sampling of graphs with prescribed degree correlationsThe mixing time of switch Markov chains: a unified approachConfiguring Random Graph Models with Fixed Degree SequencesNew Classes of Degree Sequences with Fast Mixing Swap Markov Chain SamplingHow to determine if a random graph with a fixed degree sequence has a giant componentUniform Sampling of Digraphs with a Fixed Degree SequenceConnectivity of random regular graphs generated by the pegging algorithmHalf-graphs, other non-stable degree sequences, and the switch Markov chainPolynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic TilingsUniform Generation of Random Regular GraphsSampling \(k\)-partite graphs with a given degree sequenceA Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree MatrixUniform generation of spanning regular subgraphs of a dense graphFast Sequential Creation of Random Realizations of Degree SequencesRapid Mixing of the Switch Markov Chain for 2-Class Joint Degree MatricesA triangle process on regular graphs