The cutoff phenomenon for random walk on random directed graphs
|
|
- Katherine Arnold
- 5 years ago
- Views:
Transcription
1 The cutoff phenomenon for random walk on random directed graphs Justin Salez Joint work with C. Bordenave and P. Caputo
2 Outline of the talk
3 Outline of the talk 1. The cutoff phenomenon for Markov chains
4 Outline of the talk 1. The cutoff phenomenon for Markov chains 2. Random walk on directed graphs
5 Outline of the talk 1. The cutoff phenomenon for Markov chains 2. Random walk on directed graphs 3. Main results
6 Outline of the talk 1. The cutoff phenomenon for Markov chains 2. Random walk on directed graphs 3. Main results
7 Markov chain mixing
8 Markov chain mixing Any Markov chain with irreducible, aperiodic transition matrix P on a finite state space X converges to its stationary law π = πp:
9 Markov chain mixing Any Markov chain with irreducible, aperiodic transition matrix P on a finite state space X converges to its stationary law π = πp: (x, y) X 2, P t (x, y) t π(y).
10 Markov chain mixing Any Markov chain with irreducible, aperiodic transition matrix P on a finite state space X converges to its stationary law π = πp: (x, y) X 2, P t (x, y) t π(y). Distance to equilibrium at time t: D tv (t) := max x X Pt (x, ) π( ) tv
11 Markov chain mixing Any Markov chain with irreducible, aperiodic transition matrix P on a finite state space X converges to its stationary law π = πp: (x, y) X 2, P t (x, y) t π(y). Distance to equilibrium at time t: D tv (t) := max x X Pt (x, ) π( ) tv Mixing times (0 < ε < 1): t mix (ε) := min{t 0: D tv (t) ε}
12 Example: card shuffling
13 Example: card shuffling X = S n
14 Example: card shuffling X = S n ; P = top-to-random shuffle
15 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform
16 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform Theorem (Aldous-Diaconis 86). For any fixed 0 < ε < 1, t mix(ε) n log n n 1.
17 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform Theorem (Aldous-Diaconis 86). For any fixed 0 < ε < 1, t mix(ε) n log n n 1. at t = 0.99 n log n, the deck is not mixed at all (D tv (t) 1)
18 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform Theorem (Aldous-Diaconis 86). For any fixed 0 < ε < 1, t mix(ε) n log n n 1. at t = 0.99 n log n, the deck is not mixed at all (D tv (t) 1) at t = 1.01 n log n, the deck is completely mixed (D tv (t) 0)
19 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform Theorem (Aldous-Diaconis 86). For any fixed 0 < ε < 1, t mix(ε) n log n n 1. at t = 0.99 n log n, the deck is not mixed at all (D tv (t) 1) at t = 1.01 n log n, the deck is completely mixed (D tv (t) 0) Theorem (Diaconis-Fill-Pitman 90). For any fixed λ R, D tv (n log n + λn + o(n))
20 Example: card shuffling X = S n ; P = top-to-random shuffle ; π = uniform Theorem (Aldous-Diaconis 86). For any fixed 0 < ε < 1, t mix(ε) n log n n 1. at t = 0.99 n log n, the deck is not mixed at all (D tv (t) 1) at t = 1.01 n log n, the deck is completely mixed (D tv (t) 0) Theorem (Diaconis-Fill-Pitman 90). For any fixed λ R, D tv (n log n + λn + o(n)) n Φ(λ) with Φ: R (0, 1) decreasing from Φ( ) = 1 to Φ(+ ) = 0.
21 Ubiquity of the cutoff phenomenon
22 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including
23 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...)
24 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...)
25 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...)
26 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...)
27 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs
28 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10)
29 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10) Ramanujan graphs (Lubetzky, Peres 15)
30 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10) Ramanujan graphs (Lubetzky, Peres 15) Trees (Basu, Hermon, Peres 15)
31 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10) Ramanujan graphs (Lubetzky, Peres 15) Trees (Basu, Hermon, Peres 15) Random graphs with given degrees (Berestycki, Lubetzky, Peres, Sly 15 and Ben-Hamou, S. 15)
32 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10) Ramanujan graphs (Lubetzky, Peres 15) Trees (Basu, Hermon, Peres 15) Random graphs with given degrees (Berestycki, Lubetzky, Peres, Sly 15 and Ben-Hamou, S. 15) Still, this phenomenon is far from being completely understood.
33 Ubiquity of the cutoff phenomenon Cutoff has been shown to arise in various contexts, including Card shuffling (Aldous, Diaconis, Shahshahani...) Birth-and-death chains (Diaconis, Saloff-Coste...) Random walks on finite groups (Chen, Saloff-Coste...) Glauber dynamics (Levin, Lubetzky, Luczak, Peres, Sly...) Random walks on sparse graphs Random regular graphs (Lubetzky, Sly 10) Ramanujan graphs (Lubetzky, Peres 15) Trees (Basu, Hermon, Peres 15) Random graphs with given degrees (Berestycki, Lubetzky, Peres, Sly 15 and Ben-Hamou, S. 15) Still, this phenomenon is far from being completely understood. In particular, very few results outside the reversible world...
34 1. The cutoff phenomenon for Markov chains 2. Random walk on directed graphs 3. Main results
35 Random walk on a digraph 3 5 X = {1,..., 6}
36 Random walk on a digraph 3 5 X = {1,..., 6} How long does it take for the walk to mix?
37 Random walk on a digraph 3 5 X = {1,..., 6} How long does it take for the walk to mix? What does the stationary distribution π look like?
38 Motivation: ranking algorithms (credit: the opte project)
39 Random digraph with given degrees (Cooper-Frieze 04)
40 Random digraph with given degrees (Cooper-Frieze 04) Goal: generate a random digraph G on X = {1,..., n} with given in-degrees {d x } x X and out-degrees {d + x } x X (equal sum m)
41 Random digraph with given degrees (Cooper-Frieze 04) Goal: generate a random digraph G on X = {1,..., n} with given in-degrees {d x } x X and out-degrees {d + x } x X (equal sum m)
42 Random digraph with given degrees (Cooper-Frieze 04) Goal: generate a random digraph G on X = {1,..., n} with given in-degrees {d x } x X and out-degrees {d + x } x X (equal sum m)
43 Simulation: n = , (d +, d ) = (3, 2), (3, 4), (4, 4)
44 Simulation: n = , (d +, d ) = (3, 2), (3, 4), (4, 4)
45 Distribution of the stationary masses {nπ(x): x X }
46 Distribution of the stationary masses {nπ(x): x X }
47 A glimpse at the eigenvalues
48 1. The cutoff phenomenon for Markov chains 2. Random walk on directed graphs 3. Main results
49 Cutoff and profile
50 Cutoff and profile Sparse regime: 2 d ± x with fixed as n
51 Cutoff and profile Sparse regime: 2 d x ± with fixed as n µ := 1 m x X d x log d + x
52 Cutoff and profile Sparse regime: 2 d ± x µ := 1 m x X d x log d + x Theorem 1 (cutoff): set t n = log n µ. with fixed as n
53 Cutoff and profile Sparse regime: 2 d ± x µ := 1 m x X d x log d + x Theorem 1 (cutoff): set t n = log n µ. with fixed as n D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1
54 Cutoff and profile Sparse regime: 2 d ± x with fixed as n µ := 1 dx log d x +, σ 2 := 1 m m x X Theorem 1 (cutoff): set t n = log n µ. x X d x ( log d + x µ ) 2 D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1
55 Cutoff and profile Sparse regime: 2 d ± x with fixed as n µ := 1 dx log d x +, σ 2 := 1 m m x X Theorem 1 (cutoff): set t n = log n µ. x X d x ( log d + x µ ) 2 D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1 Theorem 2 (profile): set w n = σ 2 log n µ 3
56 Cutoff and profile Sparse regime: 2 d ± x with fixed as n µ := 1 dx log d x +, σ 2 := 1 m m x X Theorem 1 (cutoff): set t n = log n µ. x X d x ( log d + x µ ) 2 D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1 Theorem 2 (profile): set w n = σ 2 log n µ 3 ( log log n).
57 Cutoff and profile Sparse regime: 2 d ± x with fixed as n µ := 1 dx log d x +, σ 2 := 1 m m x X Theorem 1 (cutoff): set t n = log n µ. x X d x ( log d + x µ ) 2 D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1 Theorem 2 (profile): set w n = σ 2 log n µ 3 ( log log n). D tv (t n + λw n + o(w n )) P n Φ(λ)
58 Cutoff and profile Sparse regime: 2 d ± x with fixed as n µ := 1 dx log d x +, σ 2 := 1 m m x X Theorem 1 (cutoff): set t n = log n µ. x X d x ( log d + x µ ) 2 D tv (λt n + o(t n )) P n { 1 if λ < 1 0 if λ > 1 Theorem 2 (profile): set w n = σ 2 log n µ 3 ( log log n). D tv (t n + λw n + o(w n )) P Φ(λ) = 1 n 2π λ e u2 2 du
59 Sensitivity to initial condition
60 Sensitivity to initial condition how does all this depend on the choice of the initial vertex?
61 Sensitivity to initial condition how does all this depend on the choice of the initial vertex? Theorem 3 (vertex irrelevance): previous results unchanged if D tv (t) := min x X Pt (x, ) π tv
62 Sensitivity to initial condition how does all this depend on the choice of the initial vertex? Theorem 3 (vertex irrelevance): previous results unchanged if D tv (t) := min x X Pt (x, ) π tv What about a more spread-out initial law, e.g. ν(x) := d x m?
63 Sensitivity to initial condition how does all this depend on the choice of the initial vertex? Theorem 3 (vertex irrelevance): previous results unchanged if D tv (t) := min x X Pt (x, ) π tv What about a more spread-out initial law, e.g. ν(x) := d x m? Theorem 4 (constant-time relaxation): for fixed t 0, νp t π tv 2 ϱt + o P (1) with ϱ 2 := 1 dx m d + x X x 1 2
64 Sensitivity to initial condition how does all this depend on the choice of the initial vertex? Theorem 3 (vertex irrelevance): previous results unchanged if D tv (t) := min x X Pt (x, ) π tv What about a more spread-out initial law, e.g. ν(x) := d x m? Theorem 4 (constant-time relaxation): for fixed t 0, νp t π tv 2 ϱt + o P (1) with ϱ 2 := 1 dx m d + x X x 1 2 Corollary: π(x) is determined by the local geometry around x only!
65 Distribution of the stationary masses {nπ(x): x X }
66 Distribution of the stationary masses {nπ(x): x X } d W (L, L ) = sup f Lip 1 (R) R f dl f dl R
67 Distribution of the stationary masses {nπ(x): x X } d W (L, L ) = sup f Lip 1 (R) R f dl f dl R Theorem 5 (asymptotics for the equilibrium masses): ( ) 1 P d W δ n nπ(x), L 0. n x
68 Distribution of the stationary masses {nπ(x): x X } d W (L, L ) = sup f Lip 1 (R) R f dl f dl R Theorem 5 (asymptotics for the equilibrium masses): ( ) 1 P d W δ n nπ(x), L 0. n x L P 1 (R) determined by the recursive distributional equation 1 d + I d I k=1 X k law = X1, in which (X k ) k 1 are i.i.d and independent of I, P(I = x) = d+ x m.
69 Thank you!
TOTAL VARIATION CUTOFF IN BIRTH-AND-DEATH CHAINS
TOTAL VARIATION CUTOFF IN BIRTH-AND-DEATH CHAINS JIAN DING, EYAL LUBETZKY AND YUVAL PERES ABSTRACT. The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence
More informationCharacterization of cutoff for reversible Markov chains
Characterization of cutoff for reversible Markov chains Yuval Peres Joint work with Riddhi Basu and Jonathan Hermon 23 Feb 2015 Joint work with Riddhi Basu and Jonathan Hermon Characterization of cutoff
More informationOberwolfach workshop on Combinatorics and Probability
Apr 2009 Oberwolfach workshop on Combinatorics and Probability 1 Describes a sharp transition in the convergence of finite ergodic Markov chains to stationarity. Steady convergence it takes a while to
More informationMixing times via super-fast coupling
s via super-fast coupling Yevgeniy Kovchegov Department of Mathematics Oregon State University Outline 1 About 2 Definition Coupling Result. About Outline 1 About 2 Definition Coupling Result. About Coauthor
More informationCharacterization of cutoff for reversible Markov chains
Characterization of cutoff for reversible Markov chains Yuval Peres Joint work with Riddhi Basu and Jonathan Hermon 3 December 2014 Joint work with Riddhi Basu and Jonathan Hermon Characterization of cutoff
More informationMIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS
MIXING TIMES OF RANDOM WALKS ON DYNAMIC CONFIGURATION MODELS Frank den Hollander Leiden University, The Netherlands New Results and Challenges with RWDRE, 11 13 January 2017, Heilbronn Institute for Mathematical
More informationXVI International Congress on Mathematical Physics
Aug 2009 XVI International Congress on Mathematical Physics Underlying geometry: finite graph G=(V,E ). Set of possible configurations: V (assignments of +/- spins to the vertices). Probability of a configuration
More informationG(t) := i. G(t) = 1 + e λut (1) u=2
Note: a conjectured compactification of some finite reversible MCs There are two established theories which concern different aspects of the behavior of finite state Markov chains as the size of the state
More informationThe coupling method - Simons Counting Complexity Bootcamp, 2016
The coupling method - Simons Counting Complexity Bootcamp, 2016 Nayantara Bhatnagar (University of Delaware) Ivona Bezáková (Rochester Institute of Technology) January 26, 2016 Techniques for bounding
More informationMixing time for a random walk on a ring
Mixing time for a random walk on a ring Stephen Connor Joint work with Michael Bate Paris, September 2013 Introduction Let X be a discrete time Markov chain on a finite state space S, with transition matrix
More informationFAST INITIAL CONDITIONS FOR GLAUBER DYNAMICS
FAST INITIAL CONDITIONS FOR GLAUBER DYNAMICS EYAL LUBETZKY AND ALLAN SLY Abstract. In the study of Markov chain mixing times, analysis has centered on the performance from a worst-case starting state.
More informationHomework set 3 - Solutions
Homework set 3 - Solutions Math 495 Renato Feres Problems 1. (Text, Exercise 1.13, page 38.) Consider the Markov chain described in Exercise 1.1: The Smiths receive the paper every morning and place it
More informationCUTOFF FOR GENERAL SPIN SYSTEMS WITH ARBITRARY BOUNDARY CONDITIONS
CUTOFF FOR GENERAL SPIN SYSTEMS WITH ARBITRARY BOUNDARY CONDITIONS EYAL LUBETZKY AND ALLAN SLY Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium.
More informationA note on adiabatic theorem for Markov chains and adiabatic quantum computation. Yevgeniy Kovchegov Oregon State University
A note on adiabatic theorem for Markov chains and adiabatic quantum computation Yevgeniy Kovchegov Oregon State University Introduction Max Born and Vladimir Fock in 1928: a physical system remains in
More informationMixing Times and Hitting Times
Mixing Times and Hitting Times David Aldous January 12, 2010 Old Results and Old Puzzles Levin-Peres-Wilmer give some history of the emergence of this Mixing Times topic in the early 1980s, and we nowadays
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationEdge Flip Chain for Unbiased Dyadic Tilings
Sarah Cannon, Georgia Tech,, David A. Levin, U. Oregon Alexandre Stauffer, U. Bath, March 30, 2018 Dyadic Tilings A dyadic tiling is a tiling on [0,1] 2 by n = 2 k dyadic rectangles, rectangles which are
More informationModern Discrete Probability Spectral Techniques
Modern Discrete Probability VI - Spectral Techniques Background Sébastien Roch UW Madison Mathematics December 22, 2014 1 Review 2 3 4 Mixing time I Theorem (Convergence to stationarity) Consider a finite
More informationCUTOFF FOR THE ISING MODEL ON THE LATTICE
CUTOFF FOR THE ISING MODEL ON THE LATTICE EYAL LUBETZKY AND ALLAN SLY Abstract. Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising
More informationIntroduction to Markov Chains and Riffle Shuffling
Introduction to Markov Chains and Riffle Shuffling Nina Kuklisova Math REU 202 University of Chicago September 27, 202 Abstract In this paper, we introduce Markov Chains and their basic properties, and
More information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More information25.1 Markov Chain Monte Carlo (MCMC)
CS880: Approximations Algorithms Scribe: Dave Andrzejewski Lecturer: Shuchi Chawla Topic: Approx counting/sampling, MCMC methods Date: 4/4/07 The previous lecture showed that, for self-reducible problems,
More informationA Proof of Aldous Spectral Gap Conjecture. Thomas M. Liggett, UCLA. Stirring Processes
A Proof of Aldous Spectral Gap Conjecture Thomas M. Liggett, UCLA Stirring Processes Given a graph G = (V, E), associate with each edge e E a Poisson process Π e with rate c e 0. Labels are put on the
More informationA note on adiabatic theorem for Markov chains
Yevgeniy Kovchegov Abstract We state and prove a version of an adiabatic theorem for Markov chains using well known facts about mixing times. We extend the result to the case of continuous time Markov
More informationDynamics for the critical 2D Potts/FK model: many questions and a few answers
Dynamics for the critical 2D Potts/FK model: many questions and a few answers Eyal Lubetzky May 2018 Courant Institute, New York University Outline The models: static and dynamical Dynamical phase transitions
More informationGlauber Dynamics for Ising Model I AMS Short Course
Glauber Dynamics for Ising Model I AMS Short Course January 2010 Ising model Let G n = (V n, E n ) be a graph with N = V n < vertices. The nearest-neighbor Ising model on G n is the probability distribution
More informationMARKOV CHAINS AND HIDDEN MARKOV MODELS
MARKOV CHAINS AND HIDDEN MARKOV MODELS MERYL SEAH Abstract. This is an expository paper outlining the basics of Markov chains. We start the paper by explaining what a finite Markov chain is. Then we describe
More informationARCC WORKSHOP: SHARP THRESHOLDS FOR MIXING TIMES SCRIBES: SHARAD GOEL, ASAF NACHMIAS, PETER RALPH AND DEVAVRAT SHAH
ARCC WORKSHOP: SHARP THRESHOLDS FOR MIXING TIMES SCRIBES: SHARAD GOEL, ASAF NACHMIAS, PETER RALPH AND DEVAVRAT SHAH Day I 1. Speaker I: Persi Diaconis Definition 1 (Sharp Threshold). A Markov chain with
More informationThe Markov Chain Monte Carlo Method
The Markov Chain Monte Carlo Method Idea: define an ergodic Markov chain whose stationary distribution is the desired probability distribution. Let X 0, X 1, X 2,..., X n be the run of the chain. The Markov
More informationConvergence Time to the Ewens Sampling Formula
Convergence Time to the Ewens Sampling Formula Joseph C. Watkins Department of Mathematics, University of Arizona, Tucson, Arizona 721 USA Abstract In this paper, we establish the cutoff phenomena for
More informationLecture 28: April 26
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 28: April 26 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationConfidence intervals for the mixing time of a reversible Markov chain from a single sample path
Confidence intervals for the mixing time of a reversible Markov chain from a single sample path Daniel Hsu Aryeh Kontorovich Csaba Szepesvári Columbia University, Ben-Gurion University, University of Alberta
More informationMARKOV CHAINS AND MIXING TIMES
MARKOV CHAINS AND MIXING TIMES BEAU DABBS Abstract. This paper introduces the idea of a Markov chain, a random process which is independent of all states but its current one. We analyse some basic properties
More informationCUTOFF FOR THE STAR TRANSPOSITION RANDOM WALK
CUTOFF FOR THE STAR TRANSPOSITION RANDOM WALK JONATHAN NOVAK AND ARIEL SCHVARTZMAN Abstract. In this note, we give a complete proof of the cutoff phenomenon for the star transposition random walk on the
More informationSpectra of Large Random Stochastic Matrices & Relaxation in Complex Systems
Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems Reimer Kühn Disordered Systems Group Department of Mathematics, King s College London Random Graphs and Random Processes, KCL
More informationcurvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13
curvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13 James R. Lee University of Washington Joint with Ronen Eldan (Weizmann) and Joseph Lehec (Paris-Dauphine) Markov chain
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
More informationThe Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates
The Contact Process on the Complete Graph with Random, Vertex-dependent, Infection Rates Jonathon Peterson Purdue University Department of Mathematics December 2, 2011 Jonathon Peterson 12/2/2011 1 / 8
More informationINFORMATION PERCOLATION AND CUTOFF FOR THE STOCHASTIC ISING MODEL
INFORMATION PERCOLATION AND CUTOFF FOR THE STOCHASTIC ISING MODEL EYAL LUBETZKY AND ALLAN SLY Abstract. We introduce a new framework for analyzing Glauber dynamics for the Ising model. The traditional
More informationLecture 2: September 8
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 2: September 8 Lecturer: Prof. Alistair Sinclair Scribes: Anand Bhaskar and Anindya De Disclaimer: These notes have not been
More informationPath Coupling and Aggregate Path Coupling
Path Coupling and Aggregate Path Coupling 0 Path Coupling and Aggregate Path Coupling Yevgeniy Kovchegov Oregon State University (joint work with Peter T. Otto from Willamette University) Path Coupling
More informationPhase Transitions in Random Discrete Structures
Institut für Optimierung und Diskrete Mathematik Phase Transition in Thermodynamics The phase transition deals with a sudden change in the properties of an asymptotically large structure by altering critical
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationAdvanced Sampling Algorithms
+ Advanced Sampling Algorithms + Mobashir Mohammad Hirak Sarkar Parvathy Sudhir Yamilet Serrano Llerena Advanced Sampling Algorithms Aditya Kulkarni Tobias Bertelsen Nirandika Wanigasekara Malay Singh
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationConductance and Rapidly Mixing Markov Chains
Conductance and Rapidly Mixing Markov Chains Jamie King james.king@uwaterloo.ca March 26, 2003 Abstract Conductance is a measure of a Markov chain that quantifies its tendency to circulate around its states.
More informationSome Definition and Example of Markov Chain
Some Definition and Example of Markov Chain Bowen Dai The Ohio State University April 5 th 2016 Introduction Definition and Notation Simple example of Markov Chain Aim Have some taste of Markov Chain and
More informationRandom Walks on Graphs. One Concrete Example of a random walk Motivation applications
Random Walks on Graphs Outline One Concrete Example of a random walk Motivation applications shuffling cards universal traverse sequence self stabilizing token management scheme random sampling enumeration
More informationEECS 495: Randomized Algorithms Lecture 14 Random Walks. j p ij = 1. Pr[X t+1 = j X 0 = i 0,..., X t 1 = i t 1, X t = i] = Pr[X t+
EECS 495: Randomized Algorithms Lecture 14 Random Walks Reading: Motwani-Raghavan Chapter 6 Powerful tool for sampling complicated distributions since use only local moves Given: to explore state space.
More informationConvergence Rate of Markov Chains
Convergence Rate of Markov Chains Will Perkins April 16, 2013 Convergence Last class we saw that if X n is an irreducible, aperiodic, positive recurrent Markov chain, then there exists a stationary distribution
More informationLatent voter model on random regular graphs
Latent voter model on random regular graphs Shirshendu Chatterjee Cornell University (visiting Duke U.) Work in progress with Rick Durrett April 25, 2011 Outline Definition of voter model and duality with
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10. x n+1 = f(x n ),
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 4: Steady-State Theory Contents 4.1 The Concept of Stochastic Equilibrium.......................... 1 4.2
More informationDecomposition Methods and Sampling Circuits in the Cartesian Lattice
Decomposition Methods and Sampling Circuits in the Cartesian Lattice Dana Randall College of Computing and School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0280 randall@math.gatech.edu
More informationLink Analysis. Leonid E. Zhukov
Link Analysis Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural Analysis and Visualization
More informationErdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
More informationMarkov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued
Markov Chains X(t) is a Markov Process if, for arbitrary times t 1 < t 2
More informationApproximate Counting and Markov Chain Monte Carlo
Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi March 18, 2011 April 8, 2011 Arindam
More information2. The averaging process
2. The averaging process David Aldous July 10, 2012 The two models in lecture 1 has only rather trivial interaction. In this lecture I discuss a simple FMIE process with less trivial interaction. It is
More informationIntroducing the Laplacian
Introducing the Laplacian Prepared by: Steven Butler October 3, 005 A look ahead to weighted edges To this point we have looked at random walks where at each vertex we have equal probability of moving
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationThe Tightness of the Kesten-Stigum Reconstruction Bound for a Symmetric Model With Multiple Mutations
The Tightness of the Kesten-Stigum Reconstruction Bound for a Symmetric Model With Multiple Mutations City University of New York Frontier Probability Days 2018 Joint work with Dr. Sreenivasa Rao Jammalamadaka
More informationCONVERGENCE THEOREM FOR FINITE MARKOV CHAINS. Contents
CONVERGENCE THEOREM FOR FINITE MARKOV CHAINS ARI FREEDMAN Abstract. In this expository paper, I will give an overview of the necessary conditions for convergence in Markov chains on finite state spaces.
More information18.175: Lecture 30 Markov chains
18.175: Lecture 30 Markov chains Scott Sheffield MIT Outline Review what you know about finite state Markov chains Finite state ergodicity and stationarity More general setup Outline Review what you know
More informationEYAL LUBETZKY AND ALLAN SLY
N EXPOSITION TO INFORMTION PERCOLTION FOR THE ISING MODEL EYL LUBETZKY ND LLN SLY bstract. Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling
More informationMixing time for the Ising model and random walks. Jian Ding
Mixing time for the Ising model and random walks by Jian Ding A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Statistics in the Graduate Division
More informationMARKOV PROCESSES. Valerio Di Valerio
MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some
More informationA lecture on the averaging process
Probability Surveys Vol. 0 (0) ISSN: 1549-5787 A lecture on the averaging process David Aldous Department of Statistics, 367 Evans Hall # 3860, U.C. Berkeley CA 9470 e-mail: aldous@stat.berkeley.edu url:
More informationOn Markov intertwinings
On Markov intertwinings Laurent Miclo Institut de Mathématiques de Toulouse Plan of the talk 1 Pitman s theorem [1975, Pitman and Rogers 1981] 2 One-dimensional diffusions 3 Multi-dimensional diffusions
More informationMath Homework 5 Solutions
Math 45 - Homework 5 Solutions. Exercise.3., textbook. The stochastic matrix for the gambler problem has the following form, where the states are ordered as (,, 4, 6, 8, ): P = The corresponding diagram
More informationarxiv: v3 [math.pr] 10 Nov 2017
Harmonic measure for biased random walk in a supercritical Galton Watson tree Shen LIN LPMA, Université Pierre et Marie Curie, Paris, France -mail: shenlinmath@gmailcom arxiv:70708v3 mathpr 0 Nov 207 November
More informationRandom doubly stochastic tridiagonal matrices
Random doubly stochastic tridiagonal matrices Persi Diaconis Departments of Statistics and Mathematics Stanford University 45 Serra Mall Stanford, CA 9435 diaconis@math.stanford.edu Philip Matchett Wood
More informationCut-off and Escape Behaviors for Birth and Death Chains on Trees
ALEA, Lat. Am. J. Probab. Math. Stat. 8, 49 6 0 Cut-off and Escape Behaviors for Birth and Death Chains on Trees Olivier Bertoncini Department of Physics, University of Aveiro, 380-93 Aveiro, Portugal.
More informationMIXING TIME OF CRITICAL ISING MODEL ON TREES IS POLYNOMIAL IN THE HEIGHT
MIXING TIME OF CRITICAL ISING MODEL ON TREES IS POLYNOMIAL IN THE HEIGHT JIAN DING, EYAL LUBETZKY AND YUVAL PERES Abstract. In the heat-bath Glauber dynamics for the Ising model on the lattice, physicists
More informationMATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015
ID NAME SCORE MATH 56/STAT 555 Applied Stochastic Processes Homework 2, September 8, 205 Due September 30, 205 The generating function of a sequence a n n 0 is defined as As : a ns n for all s 0 for which
More informationDe los ejercicios de abajo (sacados del libro de Georgii, Stochastics) se proponen los siguientes:
Probabilidades y Estadística (M) Práctica 7 2 cuatrimestre 2018 Cadenas de Markov De los ejercicios de abajo (sacados del libro de Georgii, Stochastics) se proponen los siguientes: 6,2, 6,3, 6,7, 6,8,
More informationCONVERGENCE OF KAC S RANDOM WALK
CONVERGENCE OF KAC S RANDOM WALK IGOR PAK AND SERGIY SIDENKO Abstract. We study a long standing open problem on the mixing time of Kac s random walk on SOn, R) by random rotations. We obtain an upper bound
More informationThe cover time of random walks on random graphs. Colin Cooper Alan Frieze
Happy Birthday Bela Random Graphs 1985 The cover time of random walks on random graphs Colin Cooper Alan Frieze The cover time of random walks on random graphs Colin Cooper Alan Frieze and Eyal Lubetzky
More informationDefinition A finite Markov chain is a memoryless homogeneous discrete stochastic process with a finite number of states.
Chapter 8 Finite Markov Chains A discrete system is characterized by a set V of states and transitions between the states. V is referred to as the state space. We think of the transitions as occurring
More informationOnline Social Networks and Media. Link Analysis and Web Search
Online Social Networks and Media Link Analysis and Web Search How to Organize the Web First try: Human curated Web directories Yahoo, DMOZ, LookSmart How to organize the web Second try: Web Search Information
More informationINTRODUCTION TO MARKOV CHAINS AND MARKOV CHAIN MIXING
INTRODUCTION TO MARKOV CHAINS AND MARKOV CHAIN MIXING ERIC SHANG Abstract. This paper provides an introduction to Markov chains and their basic classifications and interesting properties. After establishing
More informationCoupling. 2/3/2010 and 2/5/2010
Coupling 2/3/2010 and 2/5/2010 1 Introduction Consider the move to middle shuffle where a card from the top is placed uniformly at random at a position in the deck. It is easy to see that this Markov Chain
More informationLecture 14: Random Walks, Local Graph Clustering, Linear Programming
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 14: Random Walks, Local Graph Clustering, Linear Programming Lecturer: Shayan Oveis Gharan 3/01/17 Scribe: Laura Vonessen Disclaimer: These
More informationMarkov Chains and Mixing Times
Markov Chains and Mixing Times David A. Levin Yuval Peres Elizabeth L. Wilmer with a chapter on coupling from the past by James G. Propp and David B. Wilson DRAFT, version of September 15, 2007. 100 80
More information3. The Voter Model. David Aldous. June 20, 2012
3. The Voter Model David Aldous June 20, 2012 We now move on to the voter model, which (compared to the averaging model) has a more substantial literature in the finite setting, so what s written here
More informationMixing Time of Critical Ising Model on Trees is Polynomial in the Height
Commun. Math. Phys. 95, 161 07 010 Digital Object Identifier DOI 10.1007/s000-009-0978-y Communications in Mathematical Physics Mixing Time of Critical Ising Model on Trees is Polynomial in the Height
More informationFlip dynamics on canonical cut and project tilings
Flip dynamics on canonical cut and project tilings Thomas Fernique CNRS & Univ. Paris 13 M2 Pavages ENS Lyon November 5, 2015 Outline 1 Random tilings 2 Random sampling 3 Mixing time 4 Slow cooling Outline
More informationMarkov Chains and Computer Science
A not so Short Introduction Jean-Marc Vincent Laboratoire LIG, projet Inria-Mescal UniversitéJoseph Fourier Jean-Marc.Vincent@imag.fr Spring 2015 1 / 44 Outline 1 Markov Chain History Approaches 2 Formalisation
More informationLecture 5: Random Walks and Markov Chain
Spectral Graph Theory and Applications WS 20/202 Lecture 5: Random Walks and Markov Chain Lecturer: Thomas Sauerwald & He Sun Introduction to Markov Chains Definition 5.. A sequence of random variables
More informationABSTRACT MARKOV CHAINS, RANDOM WALKS, AND CARD SHUFFLING. Nolan Outlaw. May 2015
ABSTRACT MARKOV CHAINS, RANDOM WALKS, AND CARD SHUFFLING by Nolan Outlaw May 215 Chair: Dr. Gail Ratcliff, PhD Major Department: Mathematics A common question in the study of random processes pertains
More informationAt the boundary states, we take the same rules except we forbid leaving the state space, so,.
Birth-death chains Monday, October 19, 2015 2:22 PM Example: Birth-Death Chain State space From any state we allow the following transitions: with probability (birth) with probability (death) with probability
More informationLecture 3: September 10
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 3: September 10 Lecturer: Prof. Alistair Sinclair Scribes: Andrew H. Chan, Piyush Srivastava Disclaimer: These notes have not
More informationMarkov Chains and Mixing Times, second edition. David A. Levin Yuval Peres With contributions by Elizabeth L. Wilmer
Markov Chains and Mixing Times, second edition David A. Levin Yuval Peres With contributions by Elizabeth L. Wilmer University of Oregon E-mail address: dlevin@uoregon.edu URL: http://www.uoregon.edu/~dlevin
More informationPositive and null recurrent-branching Process
December 15, 2011 In last discussion we studied the transience and recurrence of Markov chains There are 2 other closely related issues about Markov chains that we address Is there an invariant distribution?
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More information6.842 Randomness and Computation February 24, Lecture 6
6.8 Randomness and Computation February, Lecture 6 Lecturer: Ronitt Rubinfeld Scribe: Mutaamba Maasha Outline Random Walks Markov Chains Stationary Distributions Hitting, Cover, Commute times Markov Chains
More informationStat 150 Practice Final Spring 2015
Stat 50 Practice Final Spring 205 Instructor: Allan Sly Name: SID: There are 8 questions. Attempt all questions and show your working - solutions without explanation will not receive full credit. Answer
More information