# New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling

@article{Erds2018NewCO, title={New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling}, author={P{\'e}ter L. Erd{\"o}s and Istv{\'a}n Mikl{\'o}s and Zolt{\'a}n Toroczkai}, journal={Comb. Probab. Comput.}, year={2018}, volume={27}, pages={186-207} }

In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a joint degree matrix. One approach is to use Markov chains based on edge switches (swaps) that preserve the constraints, are irreducible (ergodic) and fast… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

2

Twitter Mentions

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 11 CITATIONS

## Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence

VIEW 1 EXCERPT

CITES BACKGROUND

HIGHLY INFLUENCED

## Mixing time of the switch Markov chain and stable degree sequences

VIEW 2 EXCERPTS

CITES BACKGROUND

## Mixing time of the switch Markov chain and stable degree sequences

VIEW 2 EXCERPTS

CITES BACKGROUND

## Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

## Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals

VIEW 1 EXCERPT

CITES BACKGROUND

## Construction of Directed 2K Graphs

VIEW 1 EXCERPT

CITES BACKGROUND

## Structural Diversity and Homophily: A Study Across More Than One Hundred Big Networks

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 51 REFERENCES

## On realization graphs of degree sequences

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## On realizations of a joint degree matrix

VIEW 16 EXCERPTS

## ' " ' " ' " " " " : " " " " ' " i ?

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## The switch Markov chain for sampling irregular graphs and digraphs

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## Approximate Counting of Graphical Realizations

VIEW 7 EXCERPTS

## Corrigendum: Sampling regular graphs and a peer-to-peer network

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## The A4-structure of a graph

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## Sampling regular graphs and a peer-to-peer network

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## Decomposition of graphical sequences and unigraphs

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL