It is the presence of circuits in L d which causes difficulties in exact calculations: there are many different paths joining two specified vertices, and pairs of such paths generally have edges in common In attempting to understand critical phenomena, it is usual to tackle first the corresponding problem on a rather special lattice, being a lattice which is devoid of circuits; we do this in the hope that the ensuing calculation will be simple but will help in the development of insight into more general situations. Such a lattice is called a tree, and it is to percolation on trees that this section is devoted.
KeywordsCritical Exponent Binary Tree Open Cluster Tauberian Theorem Critical Probability
Unable to display preview. Download preview PDF.
- Menshikov, M. V. 1987b Critical points in the mathematical theory of percolation, Doctoral Dissertation, University of Moscow.Google Scholar
- Newman, C. M. 1986 Some critical exponent inequalities for percolation Journal of Statistical Physics 45, 359–368. Google Scholar
- Hara, T. and Slade, G. 1988 Mean-field critical phenomena for percolation in high dimensions, preprint.Google Scholar