A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
Random trees and random graphs
proceedings of the eighth international conference on Random structures and algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Bisecting sparse random graphs
Random Structures & Algorithms
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
Random Structures & Algorithms
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
The Diameter of a Scale-Free Random Graph
Combinatorica
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distances in random graphs with finite variance degrees
Random Structures & Algorithms
Slow emergence of the giant component in the growing m-out graph
Random Structures & Algorithms
The phase transition in the uniformly grown random graph has infinite order
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
The Small Giant Component in Scale-Free Random Graphs
Combinatorics, Probability and Computing
The Volume of the Giant Component of a Random Graph with Given Expected Degrees
SIAM Journal on Discrete Mathematics
The diameter of sparse random graphs
Random Structures & Algorithms
The k-core and branching processes
Combinatorics, Probability and Computing
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Spread-out percolation in ℝd
Random Structures & Algorithms
The k-core and branching processes
Combinatorics, Probability and Computing
Dismantling sparse random graphs
Combinatorics, Probability and Computing
A new approach to the giant component problem
Random Structures & Algorithms
How liquid is biological signalling?
Theoretical Computer Science
Combinatorics, Probability and Computing
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Random intersection graphs with tunable degree distribution and clustering
Probability in the Engineering and Informational Sciences
Merging percolation on Zd and classical random graphs: Phase transition
Random Structures & Algorithms
A Survey of Statistical Network Models
Foundations and Trends® in Machine Learning
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The largest component in subcritical inhomogeneous random graphs
Combinatorics, Probability and Computing
Diameters in supercritical random graphs via first passage percolation
Combinatorics, Probability and Computing
The diameter of sparse random graphs
Combinatorics, Probability and Computing
Component Evolution in General Random Intersection Graphs
SIAM Journal on Discrete Mathematics
Efficient generation of networks with given expected degrees
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
Ultra-fast rumor spreading in social networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
What i tell you three times is true: bootstrap percolation in small worlds
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Hi-index | 0.00 |
The “classical” random graph models, in particular G(n,p), are “homogeneous,” in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been a lot of recent interest in defining and studying “inhomogeneous” random graph models. One of the most studied properties of these new models is their “robustness”, or, equivalently, the “phase transition” as an edge density parameter is varied. For G(n,p), p = c/n, the phase transition at c = 1 has been a central topic in the study of random graphs for well over 40 years. Many of the new inhomogeneous models are rather complicated; although there are exceptions, in most cases precise questions such as determining exactly the critical point of the phase transition are approachable only when there is independence between the edges. Fortunately, some models studied have this property already, and others can be approximated by models with independence. Here we introduce a very general model of an inhomogeneous random graph with (conditional) independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p = c/n scaling for G(n,p) used to study the phase transition; also, it seems to be a property of many large real-world graphs. Our model includes as special cases many models previously studied. We show that, under one very weak assumption (that the expected number of edges is “what it should be”), many properties of the model can be determined, in particular the critical point of the phase transition, and the size of the giant component above the transition. We do this by relating our random graphs to branching processes, which are much easier to analyze. We also consider other properties of the model, showing, for example, that when there is a giant component, it is “stable”: for a typical random graph, no matter how we add or delete o(n) edges, the size of the giant component does not change by more than o(n). © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 31, 3–122, 2007