scientific article; zbMATH DE number 7378648
From MaRDI portal
Publication:5009531
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.36MaRDI QIDQ5009531
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins ⋮ Sampling hypergraphs with given degrees ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- Markov chain comparison
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Comparison theorems for reversible Markov chains
- Comparison techniques for random walk on finite groups
- The switch Markov chain for sampling irregular graphs and digraphs
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Structure and eigenvalues of heat-bath Markov chains
- Uniform Sampling of Digraphs with a Fixed Degree Sequence
- Diffusion of color in the simple exclusion process
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Approach to Stationarity of the Bernoulli–Laplace Diffusion Model
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
- Paths, Trees, and Flowers
- The switch Markov chain for sampling irregular graphs (Extended Abstract)
- Sampling Regular Graphs and a Peer-to-Peer Network
- The Factors of Graphs
- Matrix theory. Basic results and techniques
This page was built for publication:
