Localization Schemes - A Framework for Proving Mixing Bounds for Markov Chains

Localization Schemes - A Framework for Proving Mixing Bounds for Markov Chains

Institute for Advanced Study via YouTube Direct link

Introduction

1 of 13

1 of 13

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Localization Schemes - A Framework for Proving Mixing Bounds for Markov Chains

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Goals
  3. 3 Easing models
  4. 4 Markov chains
  5. 5 Global dynamics
  6. 6 Grabber dynamics
  7. 7 Nonuniqueness
  8. 8 Discrete hypercube
  9. 9 Sampling independent sets
  10. 10 Covariance matrix
  11. 11 Correlation matrix
  12. 12 Operator norms
  13. 13 Other techniques

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.