The phase transition in inhomogeneous random graphs

  title={The phase transition in inhomogeneous random graphs},
  author={B{\'e}la Bollob{\'a}s and Svante Janson and Oliver Riordan},
  journal={Random Struct. Algorithms},
We introduce a very general model of an inhomogenous random graph with 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… 
Pursuing the Giant in Random Graph Processes
We study the evolution of random graph processes that are based on the paradigm of the power of multiple choices. The processes we consider begin with an empty graph on n vertices. In each subsequent
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
Merging percolation on Zd and classical random graphs: Phase transition
A random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n) is studied, which has a natural relation to the so-called “rank 1 case” of inhomogeneous random graphs.
Merging percolation on Z d and classical random graphs: Phase transition
We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n,c-n). We show that this model, being a homogeneous random graph,
Phase Transitions in Partially Structured Random Graphs
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation
Merging percolation and classical random graphs: Phase transition in dimension 1
We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a
Random graph models and their applications
This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them
One of the most studied random graphs is G(n, p), which has n vertices that can be taken as the integers 1, . . . , n, and where each pair of vertices is connected by an edge with probability p,
Connectivity of a general class of inhomogeneous random digraphs
It is shown that by choosing the joint distribution of the vertex attributes according to a multivariate regularly varying distribution, one can obtain scale-free graphs with arbitrary in-degree/outdegree dependence.
On a general class of inhomogeneous random digraphs
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices


Dynamical random graphs with memory.
  • T. Turova
  • Mathematics, Medicine
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
By introducing a general class of dynamical graphs, the model provides a bridge between two well-known models and is a unified overview on rather different models and the relations between them.
The phase transition in the uniformly grown random graph has infinite order
The main result is that for c = 1/4 + ε, ε > 0, the giant component in Gn(c) has order exp ` −Θ(1/ √ ε) ́ n, and the phase transition in the bond percolation on Gn(1) has infinite order.
Phase Transitions in Dynamical Random Graphs
We study a large-time limit of a Markov process whose states are finite graphs. The number of the vertices is described by a supercritical branching process, and the dynamics of edges is determined
Are randomly grown graphs really random?
It is concluded that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.
A Random Graph Model for Power Law Graphs
A random graph model is proposed which is a special case of sparserandom graphs with given degree sequences which satisfy a power law and involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs.
The k-Core and Branching Processes
  • O. Riordan
  • Computer Science, Mathematics
    Combinatorics, Probability and Computing
  • 2008
A new proof of the threshold λc for the emergence of a non-trivial k-core in the random graph G(n, λ/n) is given using a local coupling of the graph to a suitable branching process and extends to a general model of inhomogeneous random graphs with independence between the edges.
The Birth of the Giant Component
A “uniform” model of random graphs, which allows self-loops and multiple edges, is shown to lead to formulas that are substanitially simpler than the analogous formulas for the classical random graphs of Erdos and Renyi.
Random graphs with arbitrary i.i.d. degrees
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not
Random graphs with arbitrary degree distributions and their applications.
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
Popularity based random graph models leading to a scale-free degree sequence
Confirming non-rigorous arguments of Dorogovtsev et al. and Drinea et al., this shows that for such a, the proportion P(d) of vertices of degree d almost surely obeys a power law, where P( d) is of the form d-^2^-^a for large d.