Ádám Timár

Most-cited papers

Boundary-connectivity via graph theory
Ádám Timár
201274 citations Open access
Semantic Scholar
On the separation profile of infinite graphs
I. Benjamini, O. Schramm, Ádám Timár
201058 citations Open access
Semantic Scholar
Tree and Grid factors of General Point processes
Ádám Timár
200441 citations Open access
Semantic Scholar
Cutsets in Infinite Graphs
Ádám Timár
2006Combinatorics, probability & computing34 citations Open access
Semantic Scholar
Comparison of quenched and annealed invariance principles for random conductance model
M. Barlow, K. Burdzy, Ádám Timár
201322 citations Open access
Semantic Scholar
Indistinguishability of the components of random spanning forests
Ádám Timár
2018Annals of Probability20 citations Open access
Semantic Scholar
Invariant matchings of exponential tail on coin flips in $\Z^d$
Ádám Timár
200920 citations
Semantic Scholar
Ends in free minimal spanning forests
Ádám Timár
200620 citations Open access
Semantic Scholar
One-ended spanning trees in amenable unimodular graphs
Ádám Timár
2018Electronic Communications in Probability13 citations Open access
Semantic Scholar
On the cluster size distribution for percolation on some general graphs
Antar Bandyopadhyay, J. Steif, Ádám Timár
200811 citations Open access
Semantic Scholar
Invariant embeddings of unimodular random planar graphs
I. Benjamini, Ádám Timár
2019Electronic Journal of Probability10 citations Open access
Semantic Scholar
Quasi-invariant means and Zimmer amenability
G. Elek, Ádám Timár
201110 citations
Semantic Scholar
A nonamenable “factor” of a Euclidean space
Ádám Timár
2017Annals of Probability9 citations Open access
Semantic Scholar
Invariant colorings of random planar maps
Ádám Timár
2009Ergodic Theory and Dynamical Systems9 citations Open access
Semantic Scholar
Unimodular random planar graphs are sofic
Ádám Timár
20198 citations
Semantic Scholar
A Poisson allocation of optimal tail
Roland Markó, Ádám Timár
20118 citations Open access
Semantic Scholar
A stationary random graph of no growth rate
Ádám Timár
20127 citations Open access
Semantic Scholar
A Factor Matching of Optimal Tail Between Poisson Processes
Ádám Timár
2021Combinatorica5 citations Open access
Semantic Scholar
Comparison of quenched and annealed invariance principles for random conductance model
M. Barlow, K. Burdzy, Ádám Timár
2015Probability theory and related fields5 citations Open access
Semantic Scholar
Invariant matchings of exponential tail on coin flips in $\Z^d$
Ádám Timár
20095 citations
Semantic Scholar
Uniform Borel Amenability
G. Elek, Ádám Timár
20244 citations
Semantic Scholar
Unimodular random one-ended planar graphs are sofic
Ádám Timár
2019Combinatorics, probability & computing4 citations Open access
Semantic Scholar
Split Hypergraphs
Ádám Timár
2008SIAM Journal on Discrete Mathematics4 citations
Semantic Scholar
Prime values of reducible polynomials, II
Yong-Gao Chen, G. Kun, Gábor Pete, I. Ruzsa +1 more
20054 citations Open access
Semantic Scholar
Finitely dependent random colorings of bounded degree graphs
Ádám Timár
2024Annales De L Institut Henri Poincare-probabilites Et Statistiques3 citations
Semantic Scholar
Invariant tilings and unimodular decorations of Cayley graphs
Ádám Timár
20183 citations
Semantic Scholar
Controllability, Matching Ratio and Graph Convergence
Dorottya Beringer, Ádám Timár
2018Journal of statistical physics3 citations Open access
Semantic Scholar
Some short proofs for connectedness of boundaries
Ádám Timár
20073 citations
Semantic Scholar
Density of growth rates of subgroups of a free group -- an alternative proof
Ádám Timár
20262 citations
Semantic Scholar
Approximating Cayley Diagrams Versus Cayley Graphs
Ádám Timár
2011Combinatorics, probability & computing2 citations
Semantic Scholar
The Almost Finite--Purely Infinite Dichotomy for Minimal Amenable Ample Groupoids
Gábor Elek, Ádám Timár
20261 citations
Semantic Scholar
Parabolic-hyperbolic dichotomy through half-plane coexistence
Ádám Timár
20261 citations
Semantic Scholar
Factor of iid’s through stochastic domination
Ádám Timár
2023Israel Journal of Mathematics1 citations Open access
Semantic Scholar
Strong almost finiteness
Gábor Elek, Ádám Timár
2023Journal of Functional Analysis0 citations Open access
Semantic Scholar
Local weak limits of random graphs and parameter continuity
Ádám Timár
20200 citations
Semantic Scholar
Silva, C. N., Buček, J. (eds.) (2017): Local government and urban governance in Europe
Ádám Timár
2019Tér és Társadalom0 citations Open access
Semantic Scholar
On the separation pro fi le of in fi nite graphs
I. Benjamini, O. Schramm, Ádám Timár
20120 citations
Semantic Scholar
Group-invariant random processes
Ádám Timár
20100 citations
Semantic Scholar
Gráfok, geometria, véletlen, algoritmusok = Graphs, geometry, randomness, algorithms
P. Hajnal, Gergely Ambrus, J. Balogh, J. Barát +7 more
20090 citations
Semantic Scholar