Question: The rooted binary tree is an infinite graph T with one distinguished vertex o ( root ) which has two neighbors; every other vertex has
The rooted binary tree is an infinite graph T with one distinguished vertex o root which has two
neighbors; every other vertex has three neighbors and there are no closed loops see the figure below
Show that the simple random walk on T is transient.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
