Showing math.PRShow all
2 papers · 1 filter
math.PR2025
Indistinguishability for recurrent clusters
Damis El Alami, Gábor Pete, Ãdám Timár
We introduce a general framework to show the indistinguishability of infinite clusters (ergodicity of the cluster subrelation) in group-invariant percolation processes with a weake…
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…