Ádám Timár

From MaRDI portal
Person:267012

Available identifiers

zbMath Open timar.adamWikidataQ102309097 ScholiaQ102309097MaRDI QIDQ267012

List of research outcomes





PublicationDate of PublicationType
Unimodular random one-ended planar graphs are sofic2024-11-05Paper
On invariant generating sets for the cycle space2024-09-11Paper
A full characterization of invariant embeddability of unimodular planar graphs2024-02-29Paper
A factor matching of optimal tail between Poisson processes2023-10-04Paper
On invariant generating sets for the cycle space2023-06-26Paper
Factor of iid's through stochastic domination2023-06-26Paper
A network-of-networks model for physical networks2023-06-02Paper
The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set2022-10-27Paper
Connectedness of the free uniform spanning forest as a function of edge weights2022-03-11Paper
Finite-energy infinite clusters without anchored expansion2021-09-10Paper
Invariant embeddings of unimodular random planar graphs2021-07-21Paper
A nonamenable ``factor of a Euclidean space2021-07-02Paper
The Free Uniform Spanning Forest is disconnected in some virtually free groups, depending on the generator set2020-06-11Paper
One-ended spanning trees in amenable unimodular graphs2019-12-12Paper
Invariant tilings and unimodular decorations of Cayley graphs2019-10-16Paper
Unimodular random one-ended planar graphs are sofic2019-10-03Paper
Controllability, matching ratio and graph convergence2019-06-14Paper
Indistinguishability of the components of random spanning forests2018-08-16Paper
On percolation critical probabilities and unimodular random graphs2018-01-18Paper
A Poisson allocation of optimal tail2016-05-12Paper
Comparison of quenched and annealed invariance principles for random conductance model. II.2016-04-15Paper
Comparison of quenched and annealed invariance principles for random conductance model2016-04-07Paper
A stationary random graph of no growth rate2014-12-05Paper
Comparison of quenched and annealed invariance principles for random conductance model: Part II2013-12-13Paper
Boundary-connectivity via graph theory2013-03-05Paper
On the separation profile of infinite graphs2013-01-17Paper
Approximating Cayley diagrams versus Cayley graphs2012-09-04Paper
Quasi-invariant means and Zimmer amenability2011-09-27Paper
Invariant colorings of random planar maps2011-05-20Paper
On the cluster size distribution for percolation on some general graphs2010-08-11Paper
Invariant matchings of exponential tail on coin flips in $\Z^d$2009-09-06Paper
Split Hypergraphs2009-08-20Paper
Percolation on nonunimodular transitive graphs2007-04-10Paper
Neighboring clusters in Bernoulli percolation2007-04-10Paper
Cutsets in Infinite Graphs2007-03-20Paper
Ends in free minimal spanning forests2006-08-03Paper
Tree and grid factors for general point processes2005-03-14Paper
Prime values of reducible polynomials, II2002-08-27Paper
Strong almost finitenessN/APaper
Finitely dependent random colorings of bounded degree graphsN/APaper

Research outcomes over time

This page was built for person: Ádám Timár