Assume and use the corrected strict identity from part (i). If a walk starts at and never returns to , then transience makes . Thus
This proves monotonicity of the capacity of a finite set for a transient random walk.

Articles by others on the same topic (0)

There are currently no matching articles.