Combinatorial Proof of the Identity for Cover Times on Finite Graphs

DOI10.4036/iis.2010.111zbMath1198.60036OpenAlexW2064134099MaRDI QIDQ3562951

Takuya Ohwa

Publication date: 28 May 2010

Published in: Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4036/iis.2010.111

zbMATH Keywords

Markov chainMöbius inversion formulacover time

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)

This page was built for publication: Combinatorial Proof of the Identity for Cover Times on Finite Graphs