On the Number of Clusters in the Percolation Model

DOI10.1112/JLMS/S2-13.2.346MaRDI QIDQ4107281zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett

Publication date 1976

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-13.2.346

Mathematics Subject Classification ID

Stochastic processes (60G99)

Cited in

(13)

• Central limit theorems for percolation models
• Analyticity properties and power law estimates of functions in percolation theory
• Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
• Density and uniqueness in percolation
• Almost subadditive multiparameter ergodic theorems
• The critical probability of bond percolation on the square lattice equals 1/2
• An interlacing technique for spectra of random walks and its application to finite percolation clusters
• Perfect domination ratios of Archimedean lattices
• Maximizing the expected number of components in an online search of a graph
• On critical probabilities in percolation theory
• A note on limit theorems in percolation
• Ergodic theorems for subadditive spatial processes
• A Banach space-valued ergodic theorem for amenable groups and applications

This page was built for publication: On the Number of Clusters in the Percolation Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4107281)