There is a natural connection between electrical networks and so called reversible Markov chains. An example for such a chain is the symmetric graph random walk which, in each step, jumps to a randomly chosen graph neighbor at equal probability. This connection is studied here in some detail. As an application, we prove the statement that if such a graph random walk is recurrent, then it is recurrent also on each subgraph. (Although this statement is rather plausible, it is hard to show by different means.) In particular, the graph random walk on a percolation cluster of the planar integer lattice is recurrent.
CITATION STYLE
Klenke, A. (2014). Markov Chains and Electrical Networks (pp. 411–438). https://doi.org/10.1007/978-1-4471-5361-0_19
Mendeley helps you to discover research relevant for your work.