Pages that link to "Item:Q3415826"

The following pages link to On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing (Q3415826):

Displaying 21 items.

• Random generators of the symmetric group: diameter, mixing time and spectral gap. (Q468709) (← links)
• Rigorous confidence bounds for MCMC under a geometric drift condition (Q617654) (← links)
• Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
• Finite groups of uniform logarithmic diameter. (Q995360) (← links)
• On coupling and the approximation of the permanent (Q1115170) (← links)
• Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
• Approximating the permanent of graphs with large factors (Q1199692) (← links)
• Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
• Chernoff-type bound for finite Markov chains (Q1296608) (← links)
• Expansion properties of Cayley graphs of the alternating groups (Q1364234) (← links)
• Lattices in graphs with polynomial growth (Q1584272) (← links)
• A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
• Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
• Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
• Nonasymptotic bounds on the estimation error of MCMC algorithms (Q2435233) (← links)
• On the diameter of permutation groups. (Q2445317) (← links)
• Hit-and-Run for Numerical Integration (Q2926241) (← links)
• Monte Carlo and Markov Chain techniques for network reliability and sampling (Q4838202) (← links)
• Fixed Precision MCMC Estimation by Median of Products of Averages (Q5321751) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
• A spectral bound for vertex-transitive graphs and their spanning subgraphs (Q6101140) (← links)