Properties of Random Graphs with Hidden Color
Statistical Mechanics
2009-11-10 v1 Soft Condensed Matter
Abstract
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global structural properties of graphs from the resulting ensembles is demonstrated. Cluster size statistics are derived with generating function techniques, yielding a well-defined percolation threshold. Explicit rules are derived for the enumeration of small subgraphs. Duality and redundancy is discussed, and subclasses corresponding to commonly studied models are identified.
Keywords
Cite
@article{arxiv.cond-mat/0305192,
title = {Properties of Random Graphs with Hidden Color},
author = {Bo Soderberg},
journal= {arXiv preprint arXiv:cond-mat/0305192},
year = {2009}
}
Comments
14 pages, LaTeX, no figures