Metrics for sparse graphs

Metrics for sparse graphs

Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric measurable function from $[0,1]^2$ to the non-negative...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Bollobas, B, Riordan, O
Format:	Book section
Udgivet:	2007

Lignende værker

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)

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

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

The diameter of sparse random graphs
af: Riordan, O, 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 phase transition in the uniformly grown random graph has infinite order
af: Bollobas, B, et al.
Udgivet: (2005)

Percolation on dense graph sequences
af: Bollobás, B, et al.
Udgivet: (2007)

Duality in inhomogeneous random graphs, and the cut metric
af: Janson, S, et al.
Udgivet: (2009)

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)

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

Sparse distance metric learning
af: Choy, T
Udgivet: (2014)

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

An old approach to the giant component problem
af: Bollobas, B, et al.
Udgivet: (2012)

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

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

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

Exploring hypergraphs with martingales
af: Bollobás, B, et al.
Udgivet: (2017)

Asymptotic normality of the size of the giant component via a random walk
af: Bollobas, B, et al.
Udgivet: (2010)

A simple branching process approach to the phase transition in $G_{n,p}$
af: Bollobas, B, et al.
Udgivet: (2012)

A note on the Harris-Kesten Theorem
af: Bollobas, B, et al.
Udgivet: (2005)

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

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

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

A short proof of the Harris-Kesten Theorem
af: Bollobas, B, et al.
Udgivet: (2004)

Asymptotic normality of the size of the giant component in a random hypergraph
af: Bollobás, B, et al.
Udgivet: (2012)

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

Asymptotic normality of the size of the giant component in a random hypergraph
af: Bollobas, B, et al.
Udgivet: (2011)

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

Asymptotic normality of the size of the giant component via a random walk
af: Bollobás, B, et al.
Udgivet: (2011)

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

Advances in graph theory /
af: Bollobas, Bela
Udgivet: (1978)

Judicious partitions of graphs
af: Bollobás, B, et al.
Udgivet: (1993)

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

Extremal graph theory /
af: 306182 Bollobas, Bela
Udgivet: (1978)

Modern graph theory /
af: 306182 Bollobas, Bela
Udgivet: (1998)

On covering by translates of a set
af: Bollobas, B, et al.
Udgivet: (2009)

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