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)