Lower Bound on Total Variation Distance

About
Privacy
Disclaimer

Graph Chatbot

In course

DEMO: excepteur exercitation anim mollit

Incididunt dolore officia eiusmod exercitation sunt ea est et et quis. Pariatur occaecat laboris ea ut. Voluptate mollit laboris laborum sunt sit deserunt amet in commodo voluptate. Ex ullamco eu magna adipisicing.

Description

This lecture covers the lower bound on the total variation distance in ergodic Markov chains with finite state space and detailed balance. It explores the quest for a matching lower bound under various assumptions and additional conditions, providing theorems and proofs. The lecture concludes with examples of cyclic random walks and their implications on mixing time.

Official source

Related lectures (31)

https://mediaspace.epfl.ch/media/0_qhr39h1c

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

DEMO: excepteur exercitation anim mollit

Related lectures (31)

Correlations of the Liouville function

Explores correlations of the Liouville function along deterministic and independent sequences, covering key concepts and theorems.

Coupling of Markov Chains: Ergodic Theorem

Explores the coupling of Markov chains and the proof of the ergodic theorem, emphasizing distribution convergence and chain properties.

Markov Chains: Ergodic Chains Examples

Covers stochastic models for communications, focusing on discrete-time Markov chains.

Markov Chains: Ergodic Chains Examples

Covers stochastic models for communications, focusing on discrete-time Markov chains.

Hitting Probabilities: Markov Chains

Covers hitting probabilities in Markov chains with disjoint subsets, the function h(i), theorems, proofs, and expected time to hit calculations.