Items where Author is "Timár, Ádám"

Timár, Ádám and Tóth, László Márton (2024) A Full Characterization of Invariant Embeddability of Unimodular Planar Graphs. RANDOM STRUCTURES & ALGORITHMS, 64 (2). pp. 320-353. ISSN 1042-9832 (print); 1098-2418 (online)

Timár, Ádám (2023) A Factor Matching of Optimal Tail Between Poisson Processes. COMBINATORICA, 43 (2). pp. 421-427. ISSN 0209-9683

Timár, Ádám (2023) Unimodular random one-ended planar graphs are sofic. COMBINATORICS PROBABILITY & COMPUTING, 32 (6). pp. 851-858. ISSN 0963-5483

Pete, Gábor and Timár, Ádám (2022) The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generator set. ANNALS OF PROBABILITY, 50 (6). pp. 2218-2243. ISSN 0091-1798

Pete, Gábor and Timár, Ádám (2021) Finite-energy infinite clusters without anchored expansion. Bernoulli Journal, 27 (4). pp. 2353-2361. ISSN 1350-7265, ESSN: 1573-9759

Benjamini, Itai and Timár, Ádám (2021) Invariant embeddings of unimodular random planar graphs. ELECTRONIC JOURNAL OF PROBABILITY, 26. ISSN 1083-6489

Timár, Ádám (2021) A Nonamenable "Factor" of a Euclidean Space. ANNALS OF PROBABILITY, 49 (3). pp. 1427-1449. ISSN 0091-1798

Beringer, Dorottya and Timár, Ádám (2018) Controllability, matching ratio and graph convergence. JOURNAL OF STATISTICAL PHYSICS. ISSN 0022-4715

Timár, Ádám (2018) Indistinguishability of the components of random spanning forests. ANNALS OF PROBABILITY, 46 (4). pp. 2221-2242. ISSN 0091-1798

Beringer, Dorottya and Pete, Gábor and Timár, Ádám (2017) On percolation critical probabilities and unimodular random graphs. ELECTRONIC JOURNAL OF PROBABILITY, 22. p. 106. ISSN 1083-6489

Markó, Roland and Timár, Ádám (2016) A poisson allocation of optimal tail. Annals of Probability, 44 (2). pp. 1285-1307. ISSN 0091-1798

Hajnal, Péter and Ambrus, Gergely and Balogh, József and Barát, János and Csaba, Béla and Mester, Péter and Mészáros, Viola and Pete, Gábor and Pluhár, András Sándor and Timár, Ádám and Varjú, Péter Pál (2009) Gráfok, geometria, véletlen, algoritmusok = Graphs, geometry, randomness, algorithms. Project Report. OTKA.