arXiv · cond-mat/0211063
A General Formalism for Inhomogeneous Random Graphs
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.
Explore related subjects
Keep this discovery
Bo Soderberg. 2002-11-04. A General Formalism for Inhomogeneous Random Graphs. https://doi.org/10.1103/physreve.66.066121
Cite the original work for its findings. Save a collection to share your selection of sources.