Back to Random Walks on Graphs Random walk on a graph: Stationary - - PowerPoint PPT Presentation

back to random walks on graphs
SMART_READER_LITE
LIVE PREVIEW

Back to Random Walks on Graphs Random walk on a graph: Stationary - - PowerPoint PPT Presentation

Back to Random Walks on Graphs Random walk on a graph: Stationary distribution: Back to Random Walks on Graphs Random walk on a graph: Stationary distribution: Detailed balance condition Detailed balance condition: An ergodic Markov chain


slide-1
SLIDE 1

Back to Random Walks on Graphs

Random walk on a graph: Stationary distribution:

slide-2
SLIDE 2

Back to Random Walks on Graphs

Random walk on a graph: Stationary distribution:

slide-3
SLIDE 3

Detailed balance condition

Detailed balance condition: An ergodic Markov chain satisfying the detailed balance condition is called reversible.

slide-4
SLIDE 4

Hitting, Commute, Cover Time

Given is a MC M=(,P). Hitting time from u to v, for u,v∈: hu,v(M) = expected number of steps of M started from u until first reach v

slide-5
SLIDE 5

Hitting, Commute, Cover Time

Given is a MC M=(,P). Hitting time from u to v, for u,v∈: hu,v(M) = expected number of steps of M started from u until first reach v Commute time between u and v, for u,v∈: Cu,v(M) = expected number of steps of M started from u to reach v and get back to u

slide-6
SLIDE 6

Hitting, Commute, Cover Time

Given is a MC M=(,P). Hitting time from u to v, for u,v∈: hu,v(M) = expected number of steps of M started from u until first reach v Commute time between u and v, for u,v∈: Cu,v(M) = expected number of steps of M started from u to reach v and get back to u Cover time: Cu(M) = expected number of steps of M started from u until every state in  has been visited at least once C(M) = maxu∈ Cu(M)

slide-7
SLIDE 7

Hitting Time of a Random Walk on a Graph

Given is a graph G.

slide-8
SLIDE 8

Resistive electrical network: Resistive electrical network:

Electrical Networks

Resistive electrical network: Rectangles: branch resistance Injecting a current of 1 ampere into b: a c 1 1 2 b

slide-9
SLIDE 9

Resistive electrical network: Resistive electrical network:

Electrical Networks

Resistive electrical network: Goal: find voltages at every node such that: Kirhoff’s Law: sum of the currents in = sum of the currents out Ohm’s Law: voltage difference across resistance = product of the current and the resistance a c 1 1 2 b

slide-10
SLIDE 10

Resistive electrical network: Resistive electrical network:

Electrical Networks

Resistive electrical network: Effective resistance between two nodes u,v: Ru,v = voltage difference when one ampere is injected into u and removed from v Example: effective resistance vs branch resistance between b,c a c 1 1 2 b

slide-11
SLIDE 11

Resistive electrical network: Resistive electrical network:

Electrical Networks and the Commute Time

Resistive electrical network: Effective resistance between two nodes u,v: Ru,v = voltage difference when one ampere is injected into u and removed from v Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v, where branch resistance = 1 on every edge. a c 1 1 2 b

slide-12
SLIDE 12

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge.

Electrical Networks and the Commute Time

slide-13
SLIDE 13

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge.

Electrical Networks and the Commute Time

slide-14
SLIDE 14

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge.

Electrical Networks and the Commute Time

slide-15
SLIDE 15

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge.

Electrical Networks and the Commute Time

slide-16
SLIDE 16

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge.

Electrical Networks and the Commute Time

slide-17
SLIDE 17

Thm: For a random walk on a graph G with m edges: Cu,v = 2mRu,v where branch resistance = 1 for every edge. Corollary: For any u,v: Cu,v ≤ n3.

Electrical Networks and the Commute Time

slide-18
SLIDE 18

Thm: For a random walk on a graph G with m edges and n vertices: C(G) ≤ 2m(n-1).

Electrical Networks and the Cover Time

slide-19
SLIDE 19

Thm: For a random walk on a graph G with m edges and n vertices: mR(G) ≤ C(G) ≤ 2e3mR(G)ln n + n, where R(G) = maxu,vRu,v.

Electrical Networks and the Cover Time