Pages that link to "Item:Q665755"
From MaRDI portal
The following pages link to A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs (Q665755):
Displaying 17 items.
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- Improved mixing rates of directed cycles by added connection (Q1741874) (← links)
- Half-graphs, other non-stable degree sequences, and the switch Markov chain (Q2040004) (← links)
- Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs (Q2135593) (← links)
- The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
- Sampling regular graphs and a peer-to-peer network (Q2921768) (← links)
- The simple random walk and max-degree walk on a directed graph (Q3633018) (← links)
- Configuring Random Graph Models with Fixed Degree Sequences (Q4641712) (← links)
- (Q5009531) (← links)
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades (Q5009568) (← links)
- Moments of Uniform Random Multigraphs with Fixed Degree Sequences (Q5037554) (← links)
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
- Regularized modified log-Sobolev inequalities and comparison of Markov chains (Q6581178) (← links)
- Mixing time of the swap Markov chain and \(P\)-stability (Q6621197) (← links)
