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

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

51 pages, 7 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Random subgraphs of finite graphs: II. The lace expansion and the triangle condition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random subgraphs of finite graphs: II. The lace expansion and the triangle condition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random subgraphs of finite graphs: II. The lace expansion and the triangle condition will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-62921

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.