2 papers
math.PR2025
Quantitative indistinguishability and sparse and dense clusters in factor of IID percolations
Endre Csóka, Péter Mester, Gábor Pete
Chifan-Ioana (2010) implies that, for any factor of IID percolation on any nonamenable Cayley graph , there is a countable set of (strong) indistinguishability classes for non-h…
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 fo…