Limit Theorems for the painting of graphs by clusters
ESAIM: PS, 5 (2001) 105-118
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Color Representations of Ising Models
Malin P. ForsströmJournal of Theoretical Probability 35 (1) 603 (2022)
https://doi.org/10.1007/s10959-020-01051-8
Generalized Divide and Color Models
Jeffrey E. Steif and Johan TykessonLatin American Journal of Probability and Mathematical Statistics 16 (2) 899 (2019)
https://doi.org/10.30757/ALEA.v16-33
Rate function of large deviation for a class of nonhomogeneous markov chains on supercritical percolation network
Zhong Hao Xu and Dong HanActa Mathematica Sinica, English Series 27 (9) 1813 (2011)
https://doi.org/10.1007/s10114-011-8349-y
Gibbsianness and non-Gibbsianness in divide and color models
András BálintThe Annals of Probability 38 (4) (2010)
https://doi.org/10.1214/09-AOP518
Asymptotic behaviors for percolation clusters with uncorrelated weights
Chunghao Hsu and Dong HanTheoretical and Mathematical Physics 157 (2) 1626 (2008)
https://doi.org/10.1007/s11232-008-0134-4
Асимптотическое поведение перколяционных кластеров с некоррелированными весами
Hsu Chunghao, Хсу Чунгхао, Хань Дун and Han DongТеоретическая и математическая физика 157 (2) 309 (2008)
https://doi.org/10.4213/tmf6281