PercolationCambridge University Press, 21 sept 2006 - 323 páginas Percolation theory was initiated some fifty years ago as a mathematical framework for the study of random physical processes such as flow through a disordered porous medium. It has proved to be a remarkably rich theory, with applications beyond natural phenomena to topics such as network modelling. The aims of this book, first published in 2006, are twofold. First to present classical results in a way that is accessible to non-specialists. Second, to describe results of Smirnov in conformal invariance, and outline the proof that the critical probability for random Voronoi percolation in the plane is 1/2. Throughout, the presentation is streamlined, with elegant and straightforward proofs requiring minimal background in probability and graph theory. Numerous examples illustrate the important concepts and enrich the arguments. All-in-all, it will be an essential purchase for mathematicians, physicists, electrical engineers and computer scientists working in this exciting area. |
Índice
Basic concepts and results | 7 |
2 | 36 |
3 | 55 |
4 | 69 |
4 | 77 |
3 | 90 |
4 | 104 |
5 | 113 |
Estimating critical probabilities | 156 |
Conformal invariance Smirnovs Theorem | 178 |
Continuum percolation | 240 |
Bibliography | 299 |
| 319 | |
Términos y frases comunes
4-marked domain A₁ Aizenman arcs Bollobás bond percolation boundary Chapter Chayes closed component conformal invariance conformal map connected constant contains corresponding critical exponents critical probability cross-ratio cycle defined disc discrete domain disjoint edge equivalent exponential decay exponents Figure finite follows function graph distance Harris's Lemma Hence hexagonal lattice holds implies independently with probability inequality infinite open cluster infinite open path joining Kesten least line segment Math Menshikov's Theorem Note obtained open crossing open horizontal crossing open independently open with probability P₁ percolation model percolation theory Phys planar lattice plane points Poisson process probability measure proof of Theorem proved radius random graphs random Voronoi percolation rectangle result Rn(x sequence set of sites site percolation site x Smirnov's square lattice subset symmetric triangular lattice unoriented upper bound vertices Voronoi cells Voronoi tessellation write
Referencias a este libro
Random Networks for Communication: From Statistical Physics to Information ... Massimo Franceschetti,Ronald Meester No hay ninguna vista previa disponible - 2008 |