The small giant component in scale-free random graphs

The small giant component in scale-free random graphs

Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the phase transition in four 'scale-free' random graph models, obtaining upper and lower bounds on the size of the giant component when there is one. In particular, we determine the extremely slo...

Bibliografske podrobnosti
Glavni avtor:	Riordan, O
Format:	Journal article
Jezik:	English
Izdano:	2005

Podobne knjige/članki

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

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

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

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

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

Giant component in random multipartite graphs with given degree sequences
od: David Gamarnik, et al.
Izdano: (2015-12-01)

Giant Component in Random Multipartite Graphs with given Degree Sequences
od: Gamarnik, David, et al.
Izdano: (2019)

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

Unimodular lattice triangulations as small-world and scale-free random graphs
od: B Krüger, et al.
Izdano: (2015-01-01)

Random graphs, models and generators of scale-free graphs
od: M. M. Bernovskiy, et al.
Izdano: (2018-10-01)

Limit distribution of the size of the giant component in a web random graph
od: Yuri Pavlov
Izdano: (2006-01-01)

Susceptibility in inhomogeneous random graphs
od: Janson, S, et al.
Izdano: (2009)

Random cliques in random graphs and sharp thresholds for F-factors
od: Riordan, O
Izdano: (2022)

Giant components for two expanding graph processes
od: Devroye, L, et al.
Izdano: (2002)

The diameter of sparse random graphs
od: Riordan, O, et al.
Izdano: (2008)

Sparse random graphs with clustering
od: Bollobas, B, et al.
Izdano: (2008)

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

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

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

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

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

How does the chromatic number of a random graph vary?
od: Heckel, A, et al.
Izdano: (2023)

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

Degree-correlation of Scale-free graphs
od: Zoran Nikoloski, et al.
Izdano: (2005-01-01)

Critical Percolation on Scale-Free Random Graphs: New Universality Class for the Configuration Model
od: Dhara, Souvik, et al.
Izdano: (2021)

Scale-Free Property for Degrees and Weights in a Preferential Attachment Random Graph Model
od: István Fazekas, et al.
Izdano: (2013-01-01)

Percolation on sequences of graphs
od: Riordan, O
Izdano: (2010)

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

The Largest Component in Critical Random Intersection Graphs
od: Wang Bin, et al.
Izdano: (2018-11-01)

Giant Cell Arteritis Presenting as Cholestatic Hepatitis
od: Gerald Riordan, et al.
Izdano: (2021-01-01)

Barabási-Albert random graphs, scale-free distributions and bounds for approximation through Stein's method
od: Ford, E
Izdano: (2009)

From Gauss graphs to giants
od: Robert de Mello Koch, et al.
Izdano: (2018-02-01)

Metrics for sparse graphs
od: Bollobas, B, et al.
Izdano: (2007)

Even harmonious labelings of disjoint graphs with a small component
od: Joseph A. Gallian, et al.
Izdano: (2015-11-01)

Random Cyclic Triangle-Free Graphs of Prime Order
od: Yu Jiang, et al.
Izdano: (2021-01-01)

The scaling limit of a critical random directed graph
od: Goldschmidt, C, et al.
Izdano: (2023)

Scaling up the Anderson transition in random-regular graphs
od: M. Pino
Izdano: (2020-11-01)

The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering
od: Shiying Huang, et al.
Izdano: (2021-01-01)

Scale-Free Random SAT Instances
od: Carlos Ansótegui , et al.
Izdano: (2022-06-01)

Logical properties of random graphs from small addable classes
od: Anuj Dawar, et al.
Izdano: (2019-07-01)