Properties of random graphs with hidden color

Bo Söderberg
Phys. Rev. E 68, 026107 – Published 12 August 2003
PDFExport Citation

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.

  • Received 8 May 2003

DOI:https://doi.org/10.1103/PhysRevE.68.026107

©2003 American Physical Society

Authors & Affiliations

Bo Söderberg*

  • Complex Systems Division, Department of Theoretical Physics, Lund University, Lund, Sweden

  • *Electronic address: Bo.Soderberg@thep.lu.se

References (Subscription Required)

Click to Expand
Issue

Vol. 68, Iss. 2 — August 2003

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×