Universal dependence of distances on nodes degrees in complex networks

We have studied dependence of distances on node degrees between vertices of Erd s-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. We have observed that the mean distance between tw...

Full description

Saved in:
Bibliographic Details
Main Authors: Holyst, Janusz A, Sienkiewicz, Julian, Fronczak, Agata, Fronczak, Piotr, Suchecki, Krzysztof, Wojcicki, Piotr
Format: Conference Proceeding
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We have studied dependence of distances on node degrees between vertices of Erd s-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. We have observed that the mean distance between two nodes of degrees ki and kj equals to lij > align=middle border=0 > = A - Blog(kikj). A simple heuristic theory for this scaling law is presented. Corrections due to the network clustering coefficient and node degree-degree correlations are taken into account.
ISSN:0094-243X
DOI:10.1063/1.1985378