On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing

DOI10.1017/S0269964800000267zbMath1133.60327WikidataQ106809541 ScholiaQ106809541MaRDI QIDQ3415826

David J. Aldous

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Stochastic processes (60G99)

Related Items (27)

A characterization of the smallest eigenvalue of a graph ⋮ Expansion properties of Cayley graphs of the alternating groups ⋮ Local Expansion of Symmetrical Graphs ⋮ Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow ⋮ Hit-and-Run for Numerical Integration ⋮ On coupling and the approximation of the permanent ⋮ Fixed Precision MCMC Estimation by Median of Products of Averages ⋮ Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Monte Carlo and Markov Chain techniques for network reliability and sampling ⋮ Rigorous confidence bounds for MCMC under a geometric drift condition ⋮ A spectral bound for vertex-transitive graphs and their spanning subgraphs ⋮ On Canonical Concurrent Flows, Crossing Number and Graph Expansion ⋮ Nonasymptotic bounds on the estimation error of MCMC algorithms ⋮ On the diameter of permutation groups. ⋮ Random generators of the symmetric group: diameter, mixing time and spectral gap. ⋮ Non-deterministic exponential time has two-prover interactive protocols ⋮ Approximating the permanent of graphs with large factors ⋮ Counting independent sets in graphs with bounded bipartite pathwidth ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ Testing monotone high‐dimensional distributions ⋮ Finite groups of uniform logarithmic diameter. ⋮ A random polynomial time algorithm for well-routing convex bodies ⋮ Algebraic algorithms for sampling from conditional distributions ⋮ Node bisectors of Cayley graphs ⋮ Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? ⋮ Chernoff-type bound for finite Markov chains ⋮ Lattices in graphs with polynomial growth

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• Convergence and finite-time behavior of simulated annealing

This page was built for publication: On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing