Properties of random graphs with hidden color
Författare
Summary, in English
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.
Publiceringsår
2003
Språk
Engelska
Publikation/Tidskrift/Serie
Physical Review E
Volym
68
Issue
2: 026107
Dokumenttyp
Artikel i tidskrift
Förlag
American Physical Society
Ämne
- Biophysics
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 1063-651X