Random graph models with hidden color

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