Pages that link to "Item:Q909471"

The following pages link to Fast uniform generation of regular graphs (Q909471):

Displaying 29 items.

• Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
• Approximating degree sequences with regular graphic sequences (extended abstract) (Q283722) (← links)
• A sequential algorithm for generating random graphs (Q603928) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
• On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
• The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
• Rejection sampling of bipartite graphs with given degree sequence (Q1737401) (← links)
• How likely is an LLD degree sequence to be graphical? (Q1774191) (← links)
• Asymptotic enumeration by degree sequence of graphs of high degree (Q1814088) (← links)
• Sampling hypergraphs with given degrees (Q1981695) (← links)
• The random transposition dynamics on random regular graphs and the Gaussian free field (Q2028963) (← links)
• Half-graphs, other non-stable degree sequences, and the switch Markov chain (Q2040004) (← links)
• Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs (Q2213805) (← links)
• The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
• Uniform generation of spanning regular subgraphs of a dense graph (Q2335698) (← links)
• Mixing time of the switch Markov chain and stable degree sequences (Q2659068) (← links)
• Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs (Q2900593) (← links)
• Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
• Random <i>k</i> -noncrossing RNA structures (Q3069233) (← links)
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (Q4291194) (← links)
• Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)
• Configuring Random Graph Models with Fixed Degree Sequences (Q4641712) (← links)
• An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
• Uniform Generation of Random Regular Graphs (Q4978195) (← 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)
• Fast uniform generation of random graphs with given degree sequences (Q6074660) (← links)
• Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
• Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)