Abstract
We consider percolation problems on regular trees and some pre-fractal graphs. Central limit theorems for the number of open clusters in a finite box are obtained. For regular trees and some classes of Sierpi´ nski carpet lattices, we can prove the central limit theorems for all p 2 (0, 1).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Publications of the Research Institute for Mathematical Sciences
Paper Title
Journal
Date
