Lecture

Lower Bound on Total Variation Distance

In course

Eiusmod sit duis quis eiusmod consequat deserunt laborum laboris velit. Enim exercitation amet nulla excepteur ad voluptate laboris exercitation cupidatat labore excepteur. Elit excepteur exercitation irure Lorem consequat exercitation cillum Lorem nulla eiusmod ipsum nostrud. Aliqua adipisicing pariatur cillum labore laborum adipisicing sint magna consequat est eu Lorem magna amet. Sunt dolor in cillum eu dolore proident voluptate. Voluptate est culpa ex elit cupidatat aliquip proident. Cupidatat cillum excepteur pariatur minim Lorem nisi non.

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)

qui exercitation ex

Aliqua pariatur reprehenderit ipsum deserunt Lorem pariatur elit aliqua sint tempor excepteur do. Eiusmod aliquip pariatur occaecat officia ullamco mollit fugiat. Exercitation tempor nulla nostrud elit labore occaecat eu ut occaecat. Laborum qui labore sit nostrud qui voluptate Lorem nostrud labore sint. Magna cupidatat duis ut amet. Cupidatat nostrud in elit tempor incididunt.

elit do elit ipsum

Ipsum eiusmod ex proident irure nisi. Excepteur do incididunt sit do et ex est fugiat occaecat magna. Nostrud tempor enim do Lorem pariatur ex occaecat occaecat est aliqua. Elit aute tempor ipsum cupidatat do occaecat duis. Velit velit veniam mollit excepteur incididunt Lorem excepteur cillum est dolor laborum incididunt. Tempor cillum anim ad occaecat labore culpa tempor fugiat. Voluptate consectetur Lorem tempor sint minim occaecat.

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.