2025/03/17 by Qinghua, Ding, Anantharam, Venkat
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR)
paper · doi:10.48550/arxiv.2503.12859
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~\citemr06, bounding the cover time of a graph by a random walk~\citedlp11, and in topics related to physics such as random walk loop soups and Brownian loop soups~\citelt07. Non-reversible versions of these theorems have been discovered by Le Jan, Eisenbaum, and Kaspi~\citelejan08, ek09, eisenbaum13. Here, we give a density-formula-based proof for all these non-reversible isomorphism theorems, extending the results in \citebhs21. Moreover, we use this method to generalize the comparison inequalities derived in \citeeisenbaum13 for permanental processes and derive an upper bound for the cover time of non-reversible Markov chains.