Sparse graphs: metrics and random models

Sparse graphs: metrics and random models

Recently, Bollob\'as, Janson and Riordan introduced a family of random graph models producing inhomogeneous graphs with $n$ vertices and $\Theta(n)$ edges whose distribution is characterized by a kernel, i.e., a symmetric measurable function $\ka:[0,1]^2 \to [0,\infty)$. To understand these mod...

Полное описание

Библиографические подробности
Главные авторы:	Bollobas, B, Riordan, O
Формат:	Journal article
Язык:	English
Опубликовано:	2008

Схожие документы

Metrics for sparse graphs
по: Bollobas, B, и др.
Опубликовано: (2007)

Sparse random graphs with clustering
по: Bollobas, B, и др.
Опубликовано: (2008)

The cut metric, random graphs, and branching processes
по: Bollobas, B, и др.
Опубликовано: (2009)

The diameter of sparse random graphs
по: Riordan, O, и др.
Опубликовано: (2008)

Duality in inhomogeneous random graphs, and the cut metric
по: Janson, S, и др.
Опубликовано: (2009)

The phase transition in inhomogeneous random graphs
по: Bollobas, B, и др.
Опубликовано: (2005)

The threshold for jigsaw percolation on random graphs
по: Bollobás, B, и др.
Опубликовано: (2017)

The phase transition in the uniformly grown random graph has infinite order
по: Bollobas, B, и др.
Опубликовано: (2005)

Monotone graph limits and quasimonotone graphs
по: Bollobas, B, и др.
Опубликовано: (2011)

Bisecting sparse random graphs.
по: Luczak, M, и др.
Опубликовано: (2001)

Percolation on random Johnson-Mehl tessellations and related models
по: Bollobas, B, и др.
Опубликовано: (2006)

Largest sparse subgraphs of random graphs.
по: Fountoulakis, N, и др.
Опубликовано: (2011)

Largest sparse subgraphs of random graphs
по: Mcdiarmid, C, и др.
Опубликовано: (2012)

Largest sparse subgraphs of random graphs
по: Fountoulakis, N, и др.
Опубликовано: (2014)

Right-convergence of sparse random graphs
по: Gamarnik, David
Опубликовано: (2014)

On the max-cut of sparse random graphs
по: Gamarnik, David, и др.
Опубликовано: (2019)

Thresholds and the structure of sparse random graphs
по: Fountoulakis, N
Опубликовано: (2003)

Erratum: Percolation on random Johnson-Mehl tessellations and related models
по: Bollobas, B, и др.
Опубликовано: (2009)

Slow emergence of the giant component in the growing m-out graph
по: Bollobas, B, и др.
Опубликовано: (2005)

An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
по: Borgs, Christian, и др.
Опубликовано: (2020)

Percolation on random Johnson-Mehl tessellations and related models (vol 140, pg 319, 2008)
по: Bollobas, B, и др.
Опубликовано: (2010)

Sparse graphs using exchangeable random measures
по: Caron, F, и др.
Опубликовано: (2017)

Packing random graphs and hypergraphs
по: Bollobas, B, и др.
Опубликовано: (2016)

Susceptibility in inhomogeneous random graphs
по: Janson, S, и др.
Опубликовано: (2009)

Random cliques in random graphs and sharp thresholds for F-factors
по: Riordan, O
Опубликовано: (2022)

The critical probability for random Voronoi percolation in the plane is 1/2
по: Bollobas, B, и др.
Опубликовано: (2004)

Asymptotic normality of the size of the giant component in a random hypergraph
по: Bollobás, B, и др.
Опубликовано: (2012)

Asymptotic normality of the size of the giant component in a random hypergraph
по: Bollobas, B, и др.
Опубликовано: (2011)

Asymptotic normality of the size of the giant component via a random walk
по: Bollobas, B, и др.
Опубликовано: (2010)

Asymptotic normality of the size of the giant component via a random walk
по: Bollobás, B, и др.
Опубликовано: (2011)

Percolation on dense graph sequences
по: Bollobás, B, и др.
Опубликовано: (2007)

Limits of local algorithms over sparse random graphs
по: Gamarnik, David, и др.
Опубликовано: (2014)

Topology Discovery of Sparse Random Graphs With Few Participants
по: Anandkumar, Animashree, и др.
Опубликовано: (2012)

Dense subgraphs in random graphs
по: Balister, P, и др.
Опубликовано: (2019)

Max Cut for Random Graphs with a Planted Partition
по: Bollobás, B, и др.
Опубликовано: (2004)

The small giant component in scale-free random graphs
по: Riordan, O
Опубликовано: (2005)

Sparse distance metric learning
по: Choy, T
Опубликовано: (2014)

On the maximum running time in graph bootstrap percolation
по: Bollobás, B, и др.
Опубликовано: (2017)

Exchangeable random measures for sparse and modular graphs with overlapping communities
по: Todeschini, A, и др.
Опубликовано: (2020)

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
по: Bayati, Mohsen, и др.
Опубликовано: (2011)