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.

Default user image.

Bo Söderberg

Teaching staff

Default user image.

Random graphs with hidden color

Author

  • Bo Söderberg

Summary, in English

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, random graphs with a given degree distribution, in a way that admits a nontrivial correlation structure in the resulting graphs. The approach unifies a number of existing random graph ensembles within a common general formalism, and allows for the analytic calculation of observable graph characteristics. In particular, generating function techniques are used to derive the size distribution of connected components (clusters) as well as the location of the percolation threshold where a giant component appears.

Department/s

  • Computational Biology and Biological Physics - Has been reorganised

Publishing year

2003

Language

English

Publication/Series

Physical Review E

Volume

68

Issue

1: 015102

Document type

Journal article

Publisher

American Physical Society

Topic

  • Biophysics

Status

Published

ISBN/ISSN/Other

  • ISSN: 1063-651X