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...
Главные авторы: | Bollobás, B, Borgs, C, Chayes, J, Riordan, O |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2007
|
Схожие документы
-
Percolation on sequences of graphs
по: Riordan, O
Опубликовано: (2010) -
The threshold for jigsaw percolation on random graphs
по: Bollobás, B, и др.
Опубликовано: (2017) -
On the maximum running time in graph bootstrap percolation
по: Bollobás, B, и др.
Опубликовано: (2017) -
Percolation.
по: Bollobás, B, и др.
Опубликовано: (2006) -
Clique percolation
по: Bollobas, B, и др.
Опубликовано: (2008)