8 citations · 9 across the 5 of their papers we have counts for
6 papers
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…
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…
Invariant splitting of a slab into infinitely many robust clusters
Péter Mester
We give an example of an invariant bond percolation process on the slab with the property that it has infinitely many clusters whose critical percolati…
A factor of i.i.d with uniform marginals and infinite clusters spanned by equal labels
Péter Mester
We give an example of an vertex-labeling of whose marginals are uniform on , and if we delete the edges between those vertices whose labels ar…
Some two-dimensional finite energy percolation processes
Olle Hägström, Péter Mester
Some examples of translation invariant site percolation processes on the lattice are constructed, the most far-reaching example being one that satisfies uniform finite energ…
Invariant monotone coupling need not exist
Péter Mester
We show by example that there is a Cayley graph, having two invariant random subgraphs X and Y, such that there exists a monotone coupling between them in the sense that $X\subset…