Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses

Research output: Contribution to journalArticlepeer-review

Abstract

We extend the theorem of Burton and Keane on uniqueness of the infinite component in dependent percolation to cover random graphs on ℤd or ℤd × ℕ with long-range edges. We also study a short-range percolation model related to nearest-neighbor spin glasses on ℤd or on a slab ℤd × {0,... K} and prove both that percolation occurs and that the infinite component is unique for V=ℤ2×{0,1} or larger.

Original languageEnglish (US)
Pages (from-to)511-527
Number of pages17
JournalProbability Theory and Related Fields
Volume92
Issue number4
DOIs
StatePublished - Dec 1992

ASJC Scopus subject areas

  • Analysis
  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses'. Together they form a unique fingerprint.

Cite this