Volume 73, Number 3, February 2006
|Page(s)||471 - 477|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||23 December 2005|
Maximum flow and topological structure of complex networks
Theoretische Physik, Universität des Saarlandes - 66041 Saarbrücken, Germany
Accepted: 2 December 2005
The problem of sending the maximum amount of flow q between two arbitrary nodes s and t of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between s and t. The average of q over all node pairs with smaller degree is for large with c a constant implying that the statistics of q is related to the degree distribution of the network. The disjoint paths between hub nodes are found to be distributed among the links belonging to the same edge-biconnected component, and q can be estimated by the number of pairs of edge-biconnected links incident to the start and terminal node. The relative size of the giant edge-biconnected component of a network approximates to the coefficient c. The applicability of our results to real-world networks is tested for the Internet at the autonomous system level.
PACS: 89.70.+c – Information theory and communication theory / 89.75.Fb – Structures and organization in complex systems / 02.60.Pn – Numerical optimization
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.