Properties of random graphs with hidden color.
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.
Söderberg
Bo
B
Complex Systems Division, Department of Theoretical Physics, Lund University, Lund, Sweden. Bo.Soderberg@thep.lu.se