Random subgraphs of finite graphs. II. The lace expansion and the triangle condition

Christian Borgs, Jennifer T. Chayes, Remco Van Der Hofstad, Gordon Slade, Joel Spencer

Research output: Contribution to journalArticle

Abstract

In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lace expansion to prove quite generally that, for finite graphs that are tori, the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set {0, 1,..., r - 1} n, including the Hamming cube on an alphabet of r letters (the n-cube, for r = 2), the n-dimensional torus with nearest-neighbor bonds and n sufficiently large, and the n-dimensional torus with n > 6 and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.

Original languageEnglish (US)
Pages (from-to)1886-1944
Number of pages59
JournalAnnals of Probability
Volume33
Issue number5
DOIs
StatePublished - Sep 2005

Fingerprint

Lace Expansion
Finite Graph
Subgraph
Triangle
Torus
Phase Transition
n-dimensional
Graph in graph theory
N-cube
Simple Random Walk
Complete Graph
Regular hexahedron
Nearest Neighbor
Graph
Lace
Imply
Vertex of a graph
Range of data
Phase transition

Keywords

  • Lace expansion
  • Percolation
  • Phase transition
  • Random graph
  • Triangle condition

ASJC Scopus subject areas

  • Mathematics(all)
  • Statistics and Probability

Cite this

Random subgraphs of finite graphs. II. The lace expansion and the triangle condition. / Borgs, Christian; Chayes, Jennifer T.; Van Der Hofstad, Remco; Slade, Gordon; Spencer, Joel.

In: Annals of Probability, Vol. 33, No. 5, 09.2005, p. 1886-1944.

Research output: Contribution to journalArticle

Borgs, Christian ; Chayes, Jennifer T. ; Van Der Hofstad, Remco ; Slade, Gordon ; Spencer, Joel. / Random subgraphs of finite graphs. II. The lace expansion and the triangle condition. In: Annals of Probability. 2005 ; Vol. 33, No. 5. pp. 1886-1944.
@article{ca53fc8e2b2d4664a160ab206b5a2c71,
title = "Random subgraphs of finite graphs. II. The lace expansion and the triangle condition",
abstract = "In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lace expansion to prove quite generally that, for finite graphs that are tori, the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set {0, 1,..., r - 1} n, including the Hamming cube on an alphabet of r letters (the n-cube, for r = 2), the n-dimensional torus with nearest-neighbor bonds and n sufficiently large, and the n-dimensional torus with n > 6 and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.",
keywords = "Lace expansion, Percolation, Phase transition, Random graph, Triangle condition",
author = "Christian Borgs and Chayes, {Jennifer T.} and {Van Der Hofstad}, Remco and Gordon Slade and Joel Spencer",
year = "2005",
month = "9",
doi = "10.1214/009117905000000260",
language = "English (US)",
volume = "33",
pages = "1886--1944",
journal = "Annals of Probability",
issn = "0091-1798",
publisher = "Institute of Mathematical Statistics",
number = "5",

}

TY - JOUR

T1 - Random subgraphs of finite graphs. II. The lace expansion and the triangle condition

AU - Borgs, Christian

AU - Chayes, Jennifer T.

AU - Van Der Hofstad, Remco

AU - Slade, Gordon

AU - Spencer, Joel

PY - 2005/9

Y1 - 2005/9

N2 - In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lace expansion to prove quite generally that, for finite graphs that are tori, the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set {0, 1,..., r - 1} n, including the Hamming cube on an alphabet of r letters (the n-cube, for r = 2), the n-dimensional torus with nearest-neighbor bonds and n sufficiently large, and the n-dimensional torus with n > 6 and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.

AB - In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lace expansion to prove quite generally that, for finite graphs that are tori, the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set {0, 1,..., r - 1} n, including the Hamming cube on an alphabet of r letters (the n-cube, for r = 2), the n-dimensional torus with nearest-neighbor bonds and n sufficiently large, and the n-dimensional torus with n > 6 and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.

KW - Lace expansion

KW - Percolation

KW - Phase transition

KW - Random graph

KW - Triangle condition

UR - http://www.scopus.com/inward/record.url?scp=27644597417&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644597417&partnerID=8YFLogxK

U2 - 10.1214/009117905000000260

DO - 10.1214/009117905000000260

M3 - Article

VL - 33

SP - 1886

EP - 1944

JO - Annals of Probability

JF - Annals of Probability

SN - 0091-1798

IS - 5

ER -