


















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。