Abstract:
We present and investigate an extension of the classical
random graph to a general class of inhomogeneous random graph
models, where vertices come in different types, and the
probability of realizing an edge depends on the types of its
terminal vertices. This approach provides a general framework
for the analysis of a large class of models. The generic
phase structure is derived using generating function
techniques, and relations to other classes of models are
pointed out.