Random Graph Models with Hidden Color

dc.creatorSoderberg, Bo
dc.date2003-07-24
dc.date.accessioned2026-07-25T22:44:13Z
dc.descriptionWe 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.
dc.description17 pages, 2 figures; contrib. to the Workshop on Random Geometry in Krakow, May 2003
dc.identifierhttps://arxiv.org/abs/cond-mat/0307617
dc.identifierhttp://arxiv.org/abs/cond-mat/0307617
dc.identifierActa Physica Polonica B 34, 5085-5102 (2003)
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/91990
dc.subjectSoft Condensed Matter
dc.subjectStatistical Mechanics
dc.titleRandom Graph Models with Hidden Color
dc.typetext

Files