The cut metric, random graphs, and branching processes

The cut metric, random graphs, and branching processes

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the sequence of matrices of edge probabilities converges to an app...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Bollobas, B, Janson, S, Riordan, O
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2009

Míreanna comhchosúla

Duality in inhomogeneous random graphs, and the cut metric
de réir: Janson, S, et al.
Foilsithe / Cruthaithe: (2009)

Sparse graphs: metrics and random models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

Sparse random graphs with clustering
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

The phase transition in inhomogeneous random graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Metrics for sparse graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2007)

The phase transition in the uniformly grown random graph has infinite order
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Monotone graph limits and quasimonotone graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2011)

A simple branching process approach to the phase transition in $G_{n,p}$
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2012)

Packing random graphs and hypergraphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2016)

Max Cut for Random Graphs with a Planted Partition
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2004)

Susceptibility in inhomogeneous random graphs
de réir: Janson, S, et al.
Foilsithe / Cruthaithe: (2009)

The threshold for jigsaw percolation on random graphs
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017)

Sesqui-type branching processes
de réir: Janson, S, et al.
Foilsithe / Cruthaithe: (2018)

Slow emergence of the giant component in the growing m-out graph
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

On covering by translates of a set
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2009)

Line-of-sight percolation
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2007)

Spread-out percolation in R^d
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Percolation on dense graph sequences
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2007)

Percolation on random Johnson-Mehl tessellations and related models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2006)

Erratum: Percolation on random Johnson-Mehl tessellations and related models
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2009)

The critical probability for random Voronoi percolation in the plane is 1/2
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)

Asymptotic normality of the size of the giant component in a random hypergraph
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2012)

Asymptotic normality of the size of the giant component in a random hypergraph
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2011)

Asymptotic normality of the size of the giant component via a random walk
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2010)

Asymptotic normality of the size of the giant component via a random walk
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2011)

On the maximum running time in graph bootstrap percolation
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017)

Percolation on random Johnson-Mehl tessellations and related models (vol 140, pg 319, 2008)
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2010)

The k-core and branching processes
de réir: Riordan, O
Foilsithe / Cruthaithe: (2005)

Dense subgraphs in random graphs
de réir: Balister, P, et al.
Foilsithe / Cruthaithe: (2019)

Random cliques in random graphs and sharp thresholds for F-factors
de réir: Riordan, O
Foilsithe / Cruthaithe: (2022)

The diameter of sparse random graphs
de réir: Riordan, O, et al.
Foilsithe / Cruthaithe: (2008)

Graph limits and exchangeable random graphs
de réir: Persi Diaconis, et al.
Foilsithe / Cruthaithe: (2008-01-01)

The small giant component in scale-free random graphs
de réir: Riordan, O
Foilsithe / Cruthaithe: (2005)

Intersections of Graphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2011)

On the max-cut of sparse random graphs
de réir: Gamarnik, David, et al.
Foilsithe / Cruthaithe: (2019)

Clique percolation
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2008)

Sharp thresholds and percolation in the plane
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)

A note on the Harris-Kesten Theorem
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2005)

Percolation on dual lattices with k-fold symmetry
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2006)

A short proof of the Harris-Kesten Theorem
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2004)