arXiv · cond-mat/0307617
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.
Explore related subjects
Keep this discovery
Bo Soderberg. 2003-07-24. Random Graph Models with Hidden Color. https://arxiv.org/abs/cond-mat/0307617
Cite the original work for its findings. Save a collection to share your selection of sources.