most citedRandom subgraphs of finite graphs: I. The scaling window under the triangle condition

89 citations · 98 across the 5 of their papers we have counts for

collaborators

5 papers

math.PR20042 cited

Asymptotic expansions in for percolation critical values on the -cube and

Remco van der Hofstad, Gordon Slade

We use the lace expansion to prove that the critical values for nearest-neighbour bond percolation on the -cube and on have asymptotic expansions, wit…

math.PR20044 cited

Expansion in for percolation critical values on the -cube and : the first three terms

Remco van der Hofstad, Gordon Slade

Let and denote the critical values for nearest-neighbour bond percolation on the -cube and on , respecti…

math.PR20043 cited

Random subgraphs of finite graphs: III. The phase transition for the -cube

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2

We study random subgraphs of the -cube , where nearest-neighbor edges are occupied with probability . Let be the value of for which the expected clust…

math.PR2004

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

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2

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 sh…

math.PR200489 cited

Random subgraphs of finite graphs: I. The scaling window under the triangle condition

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2

We study random subgraphs of an arbitrary finite connected transitive graph obtained by independently deleting edges with probability . Let be the number of ve…