SIT measures and Transience
Probability
2018-05-11 v2
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.
Keywords
Cite
@article{arxiv.1804.11316,
title = {SIT measures and Transience},
author = {Idan Perl},
journal= {arXiv preprint arXiv:1804.11316},
year = {2018}
}