Pages that link to "Item:Q2237855"
From MaRDI portal
The following pages link to The mixing time of switch Markov chains: a unified approach (Q2237855):
Displaying 14 items.
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs (Q665755) (← links)
- Half-graphs, other non-stable degree sequences, and the switch Markov chain (Q2040004) (← links)
- Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
- Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices (Q5020837) (← links)
- Moments of Uniform Random Multigraphs with Fixed Degree Sequences (Q5037554) (← links)
- Rapid mixing of the switch Markov chain for strongly stable degree sequences (Q5136927) (← links)
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
- Cutoff for rewiring dynamics on perfect matchings (Q6103979) (← links)
- Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates (Q6578650) (← links)
- Regularized modified log-Sobolev inequalities and comparison of Markov chains (Q6581178) (← links)
- Uniform generation of temporal graphs with given degrees (Q6621468) (← links)
- Approximate sampling and counting of graphs with near-regular degree intervals (Q6644114) (← links)
- Fully graphic degree sequences and P-stable degree sequences (Q6655400) (← links)