An Electric Network for Nonreversible Markov Chains

DOI10.4169/AMER.MATH.MONTHLY.123.7.657zbMATH Open1391.60171arXiv1405.7660OpenAlexW3100090264WikidataQ58300023 ScholiaQ58300023MaRDI QIDQ4576532FDOQ4576532

Authors: Márton Balázs, Áron Folly 

Publication date: 12 July 2018

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Abstract: We give an analogy between non-reversible Markov chains and electric networks much in the flavour of the classical reversible results originating from Kakutani, and later Kem'eny-Snell-Knapp and Kelly. Non-reversibility is made possible by a voltage multiplier -- a new electronic component. We prove that absorption probabilities, escape probabilities, expected number of jumps over edges and commute times can be computed from electrical properties of the network as in the classical case. The central quantity is still the effective resistance, which we do have in our networks despite the fact that individual parts cannot be replaced by a simple resistor. We rewrite a recent non-reversible result of Gaudilli`ere-Landim about the Dirichlet and Thomson principles into the electrical language. We also give a few tools that can help in reducing and solving the network. The subtlety of our network is, however, that the classical Rayleigh monotonicity is lost.

Full work available at URL: https://arxiv.org/abs/1405.7660

Recommendations

• Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains
• scientific article; zbMATH DE number 1560252
• scientific article
• Some potential-theoretic techniques in non-reversible Markov chains
• Markov loops, free field and Eulerian networks
• Electrical networks with prescribed current and applications to random walks on graphs
• scientific article
• Expectations for nonreversible Markov chains
• Nonlinear Markov processes in big networks
• scientific article; zbMATH DE number 39368

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Cites Work

• Title not available (Why is that?)
• Probability on trees and networks
• Title not available (Why is that?)
• A Dirichlet principle for non reversible Markov chains and some recurrence theorems
• Title not available (Why is that?)
• The electrical resistance of a graph captures its commute and cover times
• Title not available (Why is that?)
• The art of random walks.
• Markoff process and the Dirichlet problem

Cited In (5)

• Recurrence of Markov chain traces
• Variational formula of capacity for asymmetric Markov chains
• Metastable Markov chains
• Coevolutionary systems and PageRank
• On the Poisson equation for nonreversible Markov jump processes

This page was built for publication: An Electric Network for Nonreversible Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576532)