Cargando…

Quantifying randomness in real networks

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other r...

Descripción completa

Detalles Bibliográficos
Autores principales: Orsini, Chiara, Dankulov, Marija M., Colomer-de-Simón, Pol, Jamakovic, Almerima, Mahadevan, Priya, Vahdat, Amin, Bassler, Kevin E., Toroczkai, Zoltán, Boguñá, Marián, Caldarelli, Guido, Fortunato, Santo, Krioukov, Dmitri
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Pub. Group 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4667701/
https://www.ncbi.nlm.nih.gov/pubmed/26482121
http://dx.doi.org/10.1038/ncomms9627
_version_ 1782403879337459712
author Orsini, Chiara
Dankulov, Marija M.
Colomer-de-Simón, Pol
Jamakovic, Almerima
Mahadevan, Priya
Vahdat, Amin
Bassler, Kevin E.
Toroczkai, Zoltán
Boguñá, Marián
Caldarelli, Guido
Fortunato, Santo
Krioukov, Dmitri
author_facet Orsini, Chiara
Dankulov, Marija M.
Colomer-de-Simón, Pol
Jamakovic, Almerima
Mahadevan, Priya
Vahdat, Amin
Bassler, Kevin E.
Toroczkai, Zoltán
Boguñá, Marián
Caldarelli, Guido
Fortunato, Santo
Krioukov, Dmitri
author_sort Orsini, Chiara
collection PubMed
description Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks—the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain—and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.
format Online
Article
Text
id pubmed-4667701
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher Nature Pub. Group
record_format MEDLINE/PubMed
spelling pubmed-46677012015-12-10 Quantifying randomness in real networks Orsini, Chiara Dankulov, Marija M. Colomer-de-Simón, Pol Jamakovic, Almerima Mahadevan, Priya Vahdat, Amin Bassler, Kevin E. Toroczkai, Zoltán Boguñá, Marián Caldarelli, Guido Fortunato, Santo Krioukov, Dmitri Nat Commun Article Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks—the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain—and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs. Nature Pub. Group 2015-10-20 /pmc/articles/PMC4667701/ /pubmed/26482121 http://dx.doi.org/10.1038/ncomms9627 Text en Copyright © 2015, Nature Publishing Group, a division of Macmillan Publishers Limited. All Rights Reserved. http://creativecommons.org/licenses/by/4.0/ This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/
spellingShingle Article
Orsini, Chiara
Dankulov, Marija M.
Colomer-de-Simón, Pol
Jamakovic, Almerima
Mahadevan, Priya
Vahdat, Amin
Bassler, Kevin E.
Toroczkai, Zoltán
Boguñá, Marián
Caldarelli, Guido
Fortunato, Santo
Krioukov, Dmitri
Quantifying randomness in real networks
title Quantifying randomness in real networks
title_full Quantifying randomness in real networks
title_fullStr Quantifying randomness in real networks
title_full_unstemmed Quantifying randomness in real networks
title_short Quantifying randomness in real networks
title_sort quantifying randomness in real networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4667701/
https://www.ncbi.nlm.nih.gov/pubmed/26482121
http://dx.doi.org/10.1038/ncomms9627
work_keys_str_mv AT orsinichiara quantifyingrandomnessinrealnetworks
AT dankulovmarijam quantifyingrandomnessinrealnetworks
AT colomerdesimonpol quantifyingrandomnessinrealnetworks
AT jamakovicalmerima quantifyingrandomnessinrealnetworks
AT mahadevanpriya quantifyingrandomnessinrealnetworks
AT vahdatamin quantifyingrandomnessinrealnetworks
AT basslerkevine quantifyingrandomnessinrealnetworks
AT toroczkaizoltan quantifyingrandomnessinrealnetworks
AT bogunamarian quantifyingrandomnessinrealnetworks
AT caldarelliguido quantifyingrandomnessinrealnetworks
AT fortunatosanto quantifyingrandomnessinrealnetworks
AT krioukovdmitri quantifyingrandomnessinrealnetworks