The product condition and cutoff for non-reversible semi-birth-and-death chains

The cutoff phenomenon describes an abrupt transition in the convergence of a finite Markov chain to its stationary distribution. For reversible chains, cutoff requires the relaxation time to be negligible compared with the mixing time, a requirement known as the product condition. Basu, Hermon and Peres proved that this condition is also sufficient for reversible semi-birth-and-death chains. This thesis establishes a continuous-time, non-reversible counterpart of their result. We consider (δ, r)-semi-birth-and-death chains, whose jumps have size at most r and whose nearest-neighbour transition probabilities are bounded below by δ. In place of the usual reversible relaxation time, we use the singular-value-based relaxation time introduced by Chatterjee. The proof relates mixing to the hitting time of a central block. We show that the chain mixes rapidly after reaching this block and that the time required to reach it is sharply concentrated. It follows that whenever Chatterjee’s relaxation time is negligible compared with the mixing time, the sequence exhibits total-variation cutoff.

Authors

Publication Details

Journal
Open Collections
Published
2026-09-11
DOI
https://doi.org/10.14288/1.0456153
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

The product condition and cutoff for non-reversible semi-birth-and-death chains

Mahla Amiri
Open Collections
Markov Chains and Monte Carlo Methods
article

The product condition and cutoff for non-reversible semi-birth-and-death chains

Mahla Amiri
article en

Abstract

The cutoff phenomenon describes an abrupt transition in the convergence of a finite Markov chain to its stationary distribution. For reversible chains, cutoff requires the relaxation time to be negligible compared with the mixing time, a requirement known as the product condition. Basu, Hermon and Peres proved that this condition is also sufficient for reversible semi-birth-and-death chains. This thesis establishes a continuous-time, non-reversible counterpart of their result. We consider (δ, r)-semi-birth-and-death chains, whose jumps have size at most r and whose nearest-neighbour transition probabilities are bounded below by δ. In place of the usual reversible relaxation time, we use the singular-value-based relaxation time introduced by Chatterjee. The proof relates mixing to the hitting time of a central block. We show that the chain mixes rapidly after reaching this block and that the time required to reach it is sharply concentrated. It follows that whenever Chatterjee’s relaxation time is negligible compared with the mixing time, the sequence exhibits total-variation cutoff.

Open Collections
Reduced inequalities
Openalex Percentile: Top 8%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The product condition and cutoff for non-reversible semi-birth-and-death chains — Mahla Amiri · Open Collections (2026) | TGRS Research Map | TGRS