Random Graph Models with Hidden Color

Abstract

We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom, color, applied to vertices or stubs (half-edges). The color is assumed unobservable, but is allowed to affect edge probabilities. This serves as a convenient method to define very general classes of models within a common unifying formalism, and allowing for a non-trivial edge correlation structure.

17 pages, 2 figures; contrib. to the Workshop on Random Geometry in Krakow, May 2003

Cited by in corpus (7)

• Multilayer Networks
• The phase transition in inhomogeneous random graphs
• Analysis of complex contagions in random multiplex networks
• Conjoining Speeds up Information Diffusion in Overlaying Social-Physical Networks
• Multidimensional epidemic thresholds in diffusion processes over interdependent networks
• Diffusion of Real-Time Information in Social-Physical Networks
• All networks look the same to me: Testing for homogeneity in networks