SIT measures and Transience

MaRDI QIDQ6300991zbMATH OpenFDO

Authors Idan Perl

Publication date 30 April 2018

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probabilistic potential theory (60J45)

Abstract: A graph is called (edge)-SIT if for some probability measure on paths, the number of mutual edges in two independent paths has finite mean. We show that transience is equivalent to the property of (edge)-SIT.

This page was built for publication: SIT measures and Transience

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