The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Properties of random graphs with hidden color

På svenska

Author

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.

Publishing year

2003

Language

English

Publication/Series

Physical Review E

Volume

68

Issue

2: 026107

Document type

Journal article

Publisher

American Physical Society

Topic

  • Biophysics

Status

Published

ISBN/ISSN/Other

  • ISSN: 1063-651X