12 citations · 21 across the 2 of their papers we have counts for
3 papers
math.PR2024
A unimodular random graph with large upper growth and no growth
Péter Mester, Ádám Timár
We construct a unimodular random rooted graph with maximal degree and upper growth rate , which does not have a growth rate. Abért, Fraczyk and Hayes showed that for…
math.PR2007★ 12 cited
Percolation on nonunimodular transitive graphs
Ádám Timár
We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite cluster…
math.PR2007★ 9 cited
Neighboring clusters in Bernoulli percolation
Adám Timár
We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distan…