The switch Markov chain for sampling irregular graphs and digraphs

Catherine Greenhill, Matteo Sfragara

Type: Preprint

Publication Date: 2017-01-24

Citations: 5

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	The switch Markov chain for sampling irregular graphs and digraphs	2017	Catherine Greenhill Matteo Sfragara
+	The switch Markov chain for sampling irregular graphs and digraphs	2017	Catherine Greenhill Matteo Sfragara
+	The switch Markov chain for sampling irregular graphs	2014	Catherine Greenhill
+	The switch Markov chain for sampling irregular graphs: extended abstract	2015	Catherine Greenhill
+	The switch Markov chain for sampling irregular graphs (Extended Abstract)	2014	Catherine Greenhill
+ PDF Chat	A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs	2011	Catherine Greenhill
+	Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence	2018	Corrie Jacobien Carstens Pieter Kleer
+	Uniform sampling of undirected and directed graphs with a fixed degree sequence	2009	Annabell Berger Matthias Müller–Hannemann
+	Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices	2018	Georgios Amanatidis Pieter Kleer
+	Rapid mixing of the switch markov chain for strongly stable degree sequences and 2-class joint degree matrices	2019	Georgios Amanatidis Pieter Kleer
+ PDF Chat	Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees	2022	Daniel Allendorf Ulrich Meyer Manuel Penschuck Hung Tran
+	A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs	2011	Catherine Greenhill
+	A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs	2011	Catherine Greenhill
+	Uniform Sampling of Digraphs with a Fixed Degree Sequence	2010	Annabell Berger Matthias Müller–Hannemann
+ PDF Chat	New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling	2017	Péter L. Erdős István Miklós Zoltán Toroczkai
+	Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs	2020	Pieter Kleer Viresh Patel Fabian Stroh
+	Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs	2020	Pieter Kleer Viresh Patel Fabian Stroh
+	Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees	2021	Daniel Allendorf Ulrich Meyer Manuel Penschuck Tran Quang Hung
+ PDF Chat	Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees	2023	Daniel Allendorf Ulrich Meyer Manuel Penschuck Hung Tran
+ PDF Chat	Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs	2020	Pieter Kleer Viresh Patel Fabian Stroh

Works That Cite This (5)

Action	Title	Year	Authors
+	Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals	2017	Corrie Jacobien Carstens Pieter Kleer
+	Switch chain mixing times through triangle counts	2017	Tom Bannink Remco van der Hofstad Clara Stegehuis
+ PDF Chat	Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees	2022	Daniel Allendorf Ulrich Meyer Manuel Penschuck Hung Tran
+	An I/O-efficient Generator for Massive Complex Networks with Explicit Community Structure	2016	Michael Hamann Manuel Penschuck
+	Network-ensemble comparisons with stochastic rewiring and von Neumann entropy	2017	Zichao Li Peter J. Mucha Dane Taylor

Works Cited by This (26)

Action	Title	Year	Authors
+	Expand and Contract: Sampling graphs with given degrees and other combinatorial families	2013	James Zhao
+ PDF Chat	Algebraic algorithms for sampling from conditional distributions	1998	Persi Diaconis Bernd Sturmfels
+	Simple Markov-chain algorithms for generating bipartite graphs and tournaments	1999	Ravi Kannan Prasad Tetali Santosh Vempala
+ PDF Chat	The number of graphs and a random graph with a given degree sequence	2012	Alexander Barvinok J. A. Hartigan
+	Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow	1992	Alistair Sinclair
+ PDF Chat	Uniform generation of random regular graphs of moderate degree	1990	Brendan D. McKay Nicholas Wormald
+	Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)	1991	Brendan D. McKay Nicholas Wormald
+	Generating Random Regular Graphs Quickly	1999	Angelika Steger N. C. Wormald
+	Fast uniform generation of regular graphs	1990	Mark Jerrum Alistair Sinclair
+	A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs	1980	Béla Bollobás