Sampling Regular Graphs and a Peer-to-Peer Network
DOI10.1017/S0963548306007978zbMATH Open1137.05065DBLPjournals/cpc/CooperDG07arXiv1203.6111OpenAlexW2167223378WikidataQ56323873 ScholiaQ56323873MaRDI QIDQ5437233FDOQ5437233
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
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10)
Cited In (44)
- Sampling Edge Covers in 3-Regular Graphs
- A triangle process on regular graphs
- Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs
- Sampling \(k\)-partite graphs with a given degree sequence
- Lifted algorithms for symmetric weighted first-order model sampling
- Connectivity of random regular graphs generated by the pegging algorithm
- Uniform generation of spanning regular subgraphs of a dense graph
- Uniform Sampling of Digraphs with a Fixed Degree Sequence
- Rejection sampling of bipartite graphs with given degree sequence
- Title not available (Why is that?)
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Title not available (Why is that?)
- The mixing time of switch Markov chains: a unified approach
- Expansion and flooding in dynamic random networks with node churn
- A sequential algorithm for generating random graphs
- Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices
- Approximate sampling of graphs with near-\(P\)-stable degree intervals
- Mixing time of the swap Markov chain and \(P\)-stability
- Half-graphs, other non-stable degree sequences, and the switch Markov chain
- Exact sampling of graphs with prescribed degree correlations
- Title not available (Why is that?)
- A survey of discrete methods in (algebraic) statistics for networks
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Mixing time of the switch Markov chain and stable degree sequences
- Approximate sampling and counting of graphs with near-regular degree intervals
- Fast Sequential Creation of Random Realizations of Degree Sequences
- Constructing and sampling directed graphs with given degree sequences
- Uniform Generation of Random Regular Graphs
- On the bias of traceroute sampling
- Configuring Random Graph Models with Fixed Degree Sequences
- Fast uniform generation of random graphs with given degree sequences
- Scalable Uniform Graph Sampling by Local Computation
- Expansion properties of a random regular graph after random vertex deletions
- Sampling contingency tables
- The contact process over a dynamical \(d\)-regular graph
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
- On the bias of traceroute sampling
- The switch Markov chain for sampling irregular graphs and digraphs
- Sampling hypergraphs with given degrees
- Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings
- How to determine if a random graph with a fixed degree sequence has a giant component
- The flip Markov chain for connected regular graphs
This page was built for publication: Sampling Regular Graphs and a Peer-to-Peer Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437233)
