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...
| Huvudupphovsmän: | , , , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
2007
|