Percolation on dense graph sequences
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained by keeping each edge independently with probability $p_n$. W...
Príomhchruthaitheoirí: | Bollobás, B, Borgs, C, Chayes, J, Riordan, O |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
2007
|
Míreanna comhchosúla
-
Percolation on sequences of graphs
de réir: Riordan, O
Foilsithe / Cruthaithe: (2010) -
The threshold for jigsaw percolation on random graphs
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017) -
On the maximum running time in graph bootstrap percolation
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017) -
Percolation.
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2006) -
Clique percolation
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)