Home
Convex Optimization
Convex Optimization Group
Calculus of Inequalities
Conic Independence
Convex Cones
Convex, Affine, Conic Hulls
Convex Functions
Convex Geometry
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Euclidean Distance Matrices
Elliptope and Fantope
Extreme Directions
Eigenvalues/Eigenvectors
Farkas Lemma
Face Recognition
Fifth Metric Property
Kissing Number
Linear Algebra
Linear Matrix Inequality
Matrix Calculus
Manifold Learning
Molecular Conformation
Positive Semidefinite Cone
Projection
Quasiconvex Functions
Rank Constraint
Semidefinite Programming
Schoenberg Criterion
Sensor Network Localization
Optimization News
SEO Consultant
Video
Wikimization
Zeros of Polynomials
Contact Us
Wikimization     Meboo     Video     News     Contact     See
Felice crystal
Home arrow Optimization News arrow Total-variation cutoff in birth-and-death chains. (arXiv:0801.2625v2 [math.PR] UPDATED)
Total-variation cutoff in birth-and-death chains. (arXiv:0801.2625v2 [math.PR] UPDATED)

The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. In 1996, Diaconis surveyed this phenomenon, and asked how one could recognize its occurrence in families of finite ergodic Markov chains. In 2004, the third author noted that a necessary condition for cutoff in a family of reversible chains is that the product of the mixing-time and spectral-gap tends to infinity, and conjectured that in many settings, this condition should also be sufficient. Diaconis and Saloff-Coste (2006) verified this conjecture for birth-and-death chains with the convergence measured in separation. It is natural to ask whether the conjecture holds for these chains in the more widely used total-variation distance.

In this work, we confirm the above conjecture for all continuous-time or lazy discrete-time birth-and-death chains, with convergence measured via total-variation distance. Namely, if the product of the mixing-time and spectral-gap tends to infinity, the chains exhibit cutoff at the maximal hitting time of the stationary distribution median, with a window of at most the geometric mean between the relaxation-time and mixing-time.

Read more: http://arxiv.org/abs/0801.2625.

 

The Course

The Videos

See Inside

Convex Optimization

by Stephen Boyd 

& L. Vandenberghe 

Buy Book



See Figures

See Inside

Dattorro

by Dattorro

Buy Book



The Course

Bertsekas

by Dimitri Bertsekas 

Buy Book



See Inside

Hiriart-Urruty & Lemaréchal

by Hiriart-Urruty

& Lemaréchal

Buy Book



See Inside

Rockafellar

by Rockafellar

Buy Book



Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe