Percolation on dense graph sequences

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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Bollobás, B, Borgs, C, Chayes, J, Riordan, O
Format:	Journal article
Sprog:	English
Udgivet:	2007

Lignende værker

Percolation on sequences of graphs
af: Riordan, O
Udgivet: (2010)

The threshold for jigsaw percolation on random graphs
af: Bollobás, B, et al.
Udgivet: (2017)

On the maximum running time in graph bootstrap percolation
af: Bollobás, B, et al.
Udgivet: (2017)

Percolation.
af: Bollobás, B, et al.
Udgivet: (2006)

Clique percolation
af: Bollobas, B, et al.
Udgivet: (2008)

Degree distribution of the FKP network model.
af: Berger, N, et al.
Udgivet: (2007)

Sharp thresholds and percolation in the plane
af: Bollobas, B, et al.
Udgivet: (2004)

Line-of-sight percolation
af: Bollobas, B, et al.
Udgivet: (2007)

Percolation on self-dual polygon configurations
af: Bollobas, B, et al.
Udgivet: (2010)

Percolation on dual lattices with k-fold symmetry
af: Bollobas, B, et al.
Udgivet: (2006)

Spread-out percolation in R^d
af: Bollobas, B, et al.
Udgivet: (2005)

Percolation on random Johnson-Mehl tessellations and related models
af: Bollobas, B, et al.
Udgivet: (2006)

The critical probability for random Voronoi percolation in the plane is 1/2
af: Bollobas, B, et al.
Udgivet: (2004)

Erratum: Percolation on random Johnson-Mehl tessellations and related models
af: Bollobas, B, et al.
Udgivet: (2009)

Linear algebra and bootstrap percolation
af: Balogh, J, et al.
Udgivet: (2011)

Percolation on random Johnson-Mehl tessellations and related models (vol 140, pg 319, 2008)
af: Bollobas, B, et al.
Udgivet: (2010)

Counting dense connected hypergraphs via the probabilistic method
af: Bollobás, B, et al.
Udgivet: (2018)

Dense subgraphs in random graphs
af: Balister, P, et al.
Udgivet: (2019)

An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
af: Borgs, Christian, et al.
Udgivet: (2020)

Monotone graph limits and quasimonotone graphs
af: Bollobas, B, et al.
Udgivet: (2011)

Metrics for sparse graphs
af: Bollobas, B, et al.
Udgivet: (2007)

Sparse graphs: metrics and random models
af: Bollobas, B, et al.
Udgivet: (2008)

Sparse random graphs with clustering
af: Bollobas, B, et al.
Udgivet: (2008)

Slow emergence of the giant component in the growing m-out graph
af: Bollobas, B, et al.
Udgivet: (2005)

The phase transition in inhomogeneous random graphs
af: Bollobas, B, et al.
Udgivet: (2005)

The cut metric, random graphs, and branching processes
af: Bollobas, B, et al.
Udgivet: (2009)

Explosive percolation is continuous.
af: Riordan, O, et al.
Udgivet: (2011)

The phase transition in the uniformly grown random graph has infinite order
af: Bollobas, B, et al.
Udgivet: (2005)

The time of graph bootstrap percolation
af: Gunderson, K, et al.
Udgivet: (2016)

Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.
af: Mahendra Piraveenan, et al.
Udgivet: (2013-01-01)

Percolation in protein sequence space.
af: Patrick C F Buchholz, et al.
Udgivet: (2017-01-01)

Continuum percolation in the intrinsically secure communications graph
af: Pinto, Pedro C., et al.
Udgivet: (2011)

Percolation and Connectivity in the Intrinsically Secure Communications Graph
af: Pinto, Pedro C., et al.
Udgivet: (2013)

Percolation Driven Flooding for Energy Efficient Routing in Dense Sensor Networks
af: Gergely Vakulya, et al.
Udgivet: (2023-06-01)

Percolation Driven Flooding for Energy Efficient Routing in Dense Sensor Networks
af: Gergely Vakulya, et al.
Udgivet: (2023-06-01)

Subcritical $ \mathcal{U}$-bootstrap percolation models have non-trivial phase transitions
af: Balister, P, et al.
Udgivet: (2016)

Dense percolation in large-scale mean-field random networks is provably "explosive".
af: Alexander Veremyev, et al.
Udgivet: (2012-01-01)

Application of the information-percolation method to reconstruction problems on graphs
af: Polyanskiy, Yury, et al.
Udgivet: (2021)

Iterative Collaborative Filtering for Sparse Matrix Estimation
af: Borgs, Christian, et al.
Udgivet: (2022)

Intersections of Graphs
af: Bollobas, B, et al.
Udgivet: (2011)