1. Math
  2. Advanced Math
  3. exercise 3 rw on connected graphs is irreducible let g...

Question: exercise 3 rw on connected graphs is irreducible let g...

Question details

Exercise 3 (RW on connected graphs is irreducible. Let G = (V,E) be a connected graph. Let (X)120 be a random walk on G and denote by P its transition matrix. Let vo, Vi.. , Vk such that consecutive nodes are adjacent in G. Show that degc(vo) degç(vi) degg(vk) Conclude that random walks on connected graphs are irreducible.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution