Referenzen
20.
�dám Timár
Indistinguishability of the components of random spanning forests
Ann. Probab., 46(4):2221--2242
2018
19.
�dám Timár
Invariant tilings and unimodular decorations of Cayley graphs
Unimodularity in randomly generated graphs Band 719 aus Contemp. Math.
Seite 43--61.
Herausgeber: Amer. Math. Soc., Providence, RI,
2018
18.
Dorottya Beringer, Gábor Pete und �dám Timár
On percolation critical probabilities and unimodular random graphs
Electron. J. Probab., 22:Paper No. 106, 26
2017
17.
Roland Markó und �dám Timár
A Poisson allocation of optimal tail
Ann. Probab., 44(2):1285--1307
2016
16.
Martin Barlow, Krzysztof Burdzy und �dám Timár
Comparison of quenched and annealed invariance principles for random conductance model
Probab. Theory Related Fields, 164(3-4):741--770
2016
15.
Martin Barlow, Krzysztof Burdzy und Adám Timár
Comparison of quenched and annealed invariance principles for random conductance model: Part II
Festschrift Masatoshi Fukushima Band 17 aus Interdiscip. Math. Sci.
Seite 59--83.
Herausgeber: World Sci. Publ., Hackensack, NJ,
2015
14.
�dám Timár
A stationary random graph of no growth rate
Ann. Inst. Henri Poincaré Probab. Stat., 50(4):1161--1164
2014
13.
�dám Timár
Boundary-connectivity via graph theory
Proc. Amer. Math. Soc., 141(2):475--480
2013
12.
�dám Timár
Approximating Cayley diagrams versus Cayley graphs
Combin. Probab. Comput., 21(4):635--641
2012
11.
Itai Benjamini, Oded Schramm und �dám Timár
On the separation profile of infinite graphs
Groups Geom. Dyn., 6(4):639--658
2012
10.
�dám Timár
Invariant colorings of random planar maps
Ergodic Theory Dynam. Systems, 31(2):549--562
2011
9.
Antar Bandyopadhyay, Jeffrey Steif und �dám Timár
On the cluster size distribution for percolation on some general graphs
Rev. Mat. Iberoam., 26(2):529--550
2010
Seite:  
Previous | 0 | Next
Export als:
BibTeX, XML