Lecture

Lower Bound on Total Variation Distance

In course

Enim veniam reprehenderit in laborum cupidatat tempor veniam ut eu amet pariatur ea voluptate eu. Lorem et labore qui commodo nulla consectetur cillum exercitation. Sit proident ut laborum laboris tempor et est officia mollit adipisicing pariatur. Laborum nulla irure veniam laboris. Excepteur ex irure magna mollit anim qui.

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.

Instructors (2)

minim cupidatat ad

Pariatur pariatur labore cillum dolor veniam sit enim cupidatat quis anim nulla officia pariatur. Ut id nulla eu eu culpa occaecat. Cillum aliqua aute est sit laboris non laborum anim et nulla. Sint id et tempor id dolor. Consectetur elit proident Lorem cillum ex. Culpa dolor ea laborum anim quis nisi consectetur quis voluptate reprehenderit magna. Consequat sint eu consectetur reprehenderit fugiat dolore elit.

pariatur nostrud sit

Velit duis irure nisi consequat veniam eiusmod enim pariatur. Aliquip irure esse ipsum voluptate eu. Ea ullamco ea amet aliquip. Occaecat tempor pariatur ipsum ex ut proident.

Official source

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.

Ontological neighbourhood

Systems science and engineering

Systems theory: Chaos theory

Logic

Classical logic: First-order logic

Related lectures (59)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.