arXiv · cond-mat/0305192
Properties of Random Graphs with Hidden Color
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bo Soderberg. 2003-05-08. Properties of Random Graphs with Hidden Color. https://doi.org/10.1103/physreve.68.026107
Cite the original work for its findings. Save a collection to share your selection of sources.