Random Site Subgraphs of the Hamming Torus
نویسنده
چکیده
iv Acknowledgments v Chapter
منابع مشابه
Emergence of a Giant Component in Random Site Subgraphs of a d-Dimensional Hamming Torus
The d-dimensional Hamming torus is the graph whose vertices are all of the integer points inside an a1n×a2n×· · ·×adn box in R (for constants a1, . . . , ad > 0), and whose edges connect all vertices within Hamming distance one. We study the size of the largest connected component of the subgraph generated by independently removing each vertex of the Hamming torus with probability 1− p. We show...
متن کاملRandom subgraphs of finite graphs: II. The lace expansion and the triangle condition
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 l...
متن کاملRandom Subgraphs of Finite Graphs. Ii. the Lace Expansion and the Triangle Condition by Christian Borgs,
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 lac...
متن کاملRandom subgraphs of finite graphs: I. The scaling window under the triangle condition
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 vertices in G, and let Ω be their degree. We define the critical threshold pc = pc(G, λ) to be the value of p for which the expected cluster size of a fixed vertex attains the value λV 1/3, where λ is fixed and positive. We show that...
متن کاملConnectivity threshold for random subgraphs of the Hamming graph
We study the connectivity of random subgraphs of the d-dimensional Hamming graph H(d, n), which is the Cartesian product of d complete graphs on n vertices. We sample the random subgraph with an i.i.d. Bernoulli bond percolation onH(d, n) with parameter p. We identify the window of the transition: when np−logn → −∞ the probability that the graph is connected goes to 0, while when np − logn → +∞...
متن کامل