SIT measures and Transience
classification
🧮 math.PR
keywords
edgepathstransiencecallededgesequivalentfinitegraph
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.