17 citations · 19 across the 3 of their papers we have counts for
Showing math.PRShow all
3 papers · 1 filter
math.PR2021★ 1 cited
A full characterization of invariant embeddability of unimodular planar graphs
Ádám Timár, László Márton Tóth
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This questio…
math.PR2020★ 1 cited
Connectedness of the Free Uniform Spanning Forest as a function of edge weights
Marcell Alexy, Márton Borbényi, András Imolay +1
Let be the Cartesian product of a regular tree and a finite connected transitive graph . It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($\mathsf{…
math.PR2016
On percolation critical probabilities and unimodular random graphs
Dorottya Beringer, Gábor Pete, Ádám Timár
We investigate generalisations of the classical percolation critical probabilities , and the critical probability defined by Duminil-Copin and Tassion (201…