Mathematics – Probability
Scientific paper
2009-03-25
Mathematics
Probability
16 pages. Version v3: Removed Section 1.3 and shortened the presentation in Sections 1.4 and 4. To appear in Probab. Theory Re
Scientific paper
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This improvement finally settles a conjecture by Aizenman (1997) about the role of boundary conditions in critical high-dimensional percolation, and it is a key step in deriving further properties of critical percolation on the torus. Indeed, a criterion of Nachmias and Peres (2008) implies appropriate bounds on diameter and mixing time of the largest clusters. We further prove that the volume bounds apply also to any finite number of the largest clusters. Finally, we show that any weak limit of the largest connected component is non-degenerate, which can be viewed as a significant sign of critical behavior. The main conclusion of the paper is that the behavior of critical percolation on the high-dimensional torus is the same as for critical Erdos-Renyi random graphs.
der Hofstad Remco van
Heydenreich Markus
No associations
LandOfFree
Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-68060