New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
Publication:4643313
DOI10.1017/S0963548317000499zbMath1387.05052arXiv1601.08224OpenAlexW3099240298MaRDI QIDQ4643313
István Miklós, Zoltán Toroczkai, Péter L. Erdős
Publication date: 24 May 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.08224
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Vertex degrees (05C07) Random walks on graphs (05C81)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On realization graphs of degree sequences
- On realizations of a joint degree matrix
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
- Split digraphs
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- The splittance of a graph
- Comparison theorems for reversible Markov chains
- Decomposition of graphical sequences and unigraphs
- Markov chain decomposition for convergence rate analysis
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Neighborhood degree lists of graphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- The A4-structure of a graph
- Combinatorial Properties of Matrices of Zeros and Ones
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- Degree-based graph construction
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- The switch Markov chain for sampling irregular graphs (Extended Abstract)
- Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
- Sampling Regular Graphs and a Peer-to-Peer Network
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Difference graphs
- Sampling binary contingency tables with a greedy start
This page was built for publication: New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
