DPG Phi
Verhandlungen
Verhandlungen
DPG

Dresden 2006 – scientific programme

Parts | Days | Selection | Search | Downloads | Help

DY: Dynamik und Statistische Physik

DY 12: Statistical Physics of Complex Networks II

DY 12.1: Talk

Monday, March 27, 2006, 11:00–11:15, H\"UL 186

Universal dependence of inter-node distances in complex networks — •Janusz A. Hołyst, Julian Sienkiewicz, Agata Fronczak, Piotr Fronczak, and Krzysztof Suchecki — Faculty of Physics, Warsaw University of Technology, Koszykowa 75, 00-662 Warszawa, Poland

We observe a universal scaling of internode distances in Erdős-Rényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. The average shortest distance between two nodes of degrees ki and kj is equal to ⟨ lij⟩=ABlog(ki kj). The scaling holds over several decades. We present a simple theory for the appearance of this scaling where parameters A and B depend on the mean value of a node degree ⟨ knn calculated for the nearest neighbors and on network clustering coefficients. Corrections due to node degree-degree correlations are taken into account.

100% | Mobile Layout | Deutsche Version | Contact/Imprint/Privacy
DPG-Physik > DPG-Verhandlungen > 2006 > Dresden