The Density Formula Approach for Non-reversible Isomorphism Theorems, with Applications
This work advances theoretical understanding of non-reversible Markov chains, offering new tools for bounding cover times and analyzing permanental processes.
The authors provide a density-formula-based proof for non-reversible isomorphism theorems, extending previous results, and use it to generalize comparison inequalities for permanental processes and derive an upper bound for the cover time of non-reversible Markov chains.
The classical isomorphism theorems for reversible Markov chains have played an important role in studying the properties of local time processes of strongly symmetric Markov processes~\cite{mr06}, bounding the cover time of a graph by a random walk~\cite{dlp11}, and in topics related to physics, such as random walk loop soups and Brownian loop soups~\cite{lt07}. Non-reversible versions of these theorems have been discovered by Le Jan, Eisenbaum, and Kaspi~\cite{lejan08, ek09, eisenbaum13}. Here, we give a density-formula-based proof for all these non-reversible isomorphism theorems, extending the results in \cite{bhs21}. Moreover, we use this method to generalize the comparison inequalities derived in \cite{eisenbaum13} for permanental processes and derive an upper bound for the cover time of non-reversible Markov chains.