  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.
