Year: 2018
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Perl, Idan
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2798907444