2 citations · 3 across the 4 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2018
SIT measures and Transience
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…
math.PR2013★ 1 cited
Extinction window of mean field branching annihilating random walk
Idan Perl, Arnab Sen, Ariel Yadin
We study a model of growing population that competes for resources. At each time step, all existing particles reproduce and the offspring randomly move to neighboring sites. Then a…