2 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Idan Perl
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…