Pages that link to "Item:Q3951346"

The following pages link to Some Inequalities for Reversible Markov Chains (Q3951346):

Displaying 33 items.

• Interacting particle systems as stochastic social dynamics (Q373520) (← links)
• Mixing times are hitting times of large sets (Q495704) (← links)
• Faster mixing and small bottlenecks (Q863483) (← links)
• Meeting times for independent Markov chains (Q1177207) (← links)
• A rapidly mixing stochastic system of finite interacting particles on the circle (Q1382526) (← links)
• Hitting time and mixing time bounds of Stein's factors (Q1748553) (← links)
• Mixing time bounds via bottleneck sequences (Q1756546) (← links)
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. (Q1963611) (← links)
• Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
• Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions (Q1990229) (← links)
• Hitting, mixing and tunneling asymptotics of Metropolis-Hastings reversiblizations in the low-temperature regime (Q1996146) (← links)
• Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453) (← links)
• The toom interface via coupling (Q2175123) (← links)
• A spectral characterization for concentration of the cover time (Q2209316) (← links)
• A comparison principle for random walk on dynamical percolation (Q2212614) (← links)
• Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms (Q2240840) (← links)
• Quenched localisation in the Bouchaud trap model with slowly varying traps (Q2359742) (← links)
• Fast perfect sampling from linear extensions (Q2368931) (← links)
• Systematic scan for sampling colorings (Q2494577) (← links)
• The mixing time of the giant component of a random graph (Q2930052) (← links)
• The mixing time of Glauber dynamics for coloring regular trees (Q3057064) (← links)
• Tight inequalities among set hitting times in Markov chains (Q3190216) (← links)
• The Quantum Complexity of Markov Chain Monte Carlo (Q3507468) (← links)
• Self-intersections of random walks on discrete groups (Q3681675) (← links)
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (Q4291194) (← links)
• On mixing times for stratified walks on thed-cube (Q4543635) (← links)
• A technical report on hitting times, mixing and cutoff (Q4603436) (← links)
• Quantum mixing of Markov chains for special distributions (Q5144028) (← links)
• Mean unknotting times of random knots and embeddings (Q5239356) (← links)
• Perfect Simulation for Image Restoration (Q5421586) (← links)
• Dobrushin Conditions and Systematic Scan (Q5901449) (← links)
• Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs (Q6085090) (← links)
• Improvement of quantum walks search algorithm in single-marked vertex graph (Q6096899) (← links)