C. Borgs

activity

20032005

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

89 citations · 123 across the 9 of their papers we have counts for

collaborators

Showing 2004Show all

4 papers · 1 filter

cond-mat.stat-mech2004

Competition-Induced Preferential Attachment

N. Berger, C. Borgs, J. T. Chayes +2

Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here,…

math.PR2004★ 3 cited

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

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

We study random subgraphs of the $n$ -cube ${0, 1}^{n}$ , where nearest-neighbor edges are occupied with probability $p$ . Let $p_{c} (n)$ be the value of $p$ 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.PR2004★ 89 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 $G$ obtained by independently deleting edges with probability $1 - p$ . Let $V$ be the number of ve…

Competition-Induced Preferential Attachment

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

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

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

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