1992
DOI: 10.1007/bf01274266
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Summary.We extend the theorem of Burton and Keane on uniqueness of the infinite component in dependent percolation to cover random graphs on 7/e or zdx N with long-range edges. We also study a short-range percolation model related to nearest-neighbor spin glasses on ;ge or on a slab ;ge x {0,..., K } and prove both that percolation occurs and that the infinite component is unique for V = ~2 x {0, 1} or larger.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
81
0
3

Year Published

1993
1993
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 97 publications
(86 citation statements)
references
References 26 publications
2
81
0
3
Order By: Relevance
“…This is a direct consequence of Theorem 1 from [13], once we show that the limiting measure satisfies the positive finite energy condition. Using a slightly stronger form of the condition than that in [13], we say that a GRC measure µ has positive finite energy if for all bonds b ∈ B(Z d ), we have…”
Section: Uniqueness Of the Infinite Clustermentioning
confidence: 99%
See 2 more Smart Citations
“…This is a direct consequence of Theorem 1 from [13], once we show that the limiting measure satisfies the positive finite energy condition. Using a slightly stronger form of the condition than that in [13], we say that a GRC measure µ has positive finite energy if for all bonds b ∈ B(Z d ), we have…”
Section: Uniqueness Of the Infinite Clustermentioning
confidence: 99%
“…In order to prove (3.15), we have to work a bit harder. Let (∆ n ) n≥1 be an increasing sequence of boxes centered at the origin and let 13) and…”
Section: Lemma 52mentioning
confidence: 99%
See 1 more Smart Citation
“…Just as in the ferromagnet, if percolation of a random cluster occurs in the FK representation, the percolating cluster is unique (in each realization of FK spins and bonds) [25,30]. In spite of this, RC percolation alone is no longer sufficient to prove broken spin-flip symmetry in the EA spin glass.…”
Section: B Spin Glass Models; the Trfk Representationmentioning
confidence: 99%
“…The connected components of this graph are called clusters. If is amenable, then Burton and Keane [5] and Gandolfi et al [8] proved that there is at most one infinite cluster almost surely. A major open conjecture of Benjamini and Schramm [3] is the converse, that if is non-amenable, then, for some interval of p, there are infinitely many infinite clusters almost surely.…”
Section: Introductionmentioning
confidence: 99%