Transport in networks with multiple sources and sinks

被引:28
作者
Carmi, S. [1 ,2 ,3 ,4 ]
Wu, Z. [3 ,4 ]
Havlin, S. [1 ,2 ]
Stanley, H. E. [3 ,4 ]
机构
[1] Bar Ilan Univ, Minerva Ctr, IL-52900 Ramat Gan, Israel
[2] Bar Ilan Univ, Dept Phys, IL-52900 Ramat Gan, Israel
[3] Boston Univ, Ctr Polymer Studies, Boston, MA 02215 USA
[4] Boston Univ, Dept Phys, Boston, MA 02215 USA
关键词
D O I
10.1209/0295-5075/84/28005
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks. We derive analytical formulas for the average current and flow as a function of n. We show that for small n, increasing n improves the total transport in the network, while for large n bottlenecks begin to form. For the case of flow, this leads to an optimal n* above which the transport is less efficient. For current, the typical decrease in the length of the connecting paths for large n compensates for the effect of the bottlenecks. We also derive an expression for the average flow as a function of n under the common limitation that transport takes place between specific pairs of sources and sinks. Copyright (c) EPLA, 2008
引用
收藏
页数:6
相关论文
共 26 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]  
[Anonymous], [No title captured]
[3]  
Ben-Avraham D, 2000, Diffusion and reactions in fractals and disordered systems
[4]  
Bollobas B., 2001, CAMBRIDGE STUDIES AD, V73
[5]   What is special about diffusion on scale-free nets? [J].
Bollt, EM ;
ben-Avraham, D .
NEW JOURNAL OF PHYSICS, 2005, 7
[6]   Transport between multiple users in complex networks [J].
Carmi, S. ;
Wu, Z. ;
Lopez, E. ;
Havlin, S. ;
Stanley, H. Eugene .
EUROPEAN PHYSICAL JOURNAL B, 2007, 57 (02) :165-174
[7]   A model of Internet topology using k-shell decomposition [J].
Carmi, Shai ;
Havlin, Shlomo ;
Kirkpatrick, Scott ;
Shavitt, Yuval ;
Shir, Eran .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2007, 104 (27) :11150-11154
[8]   On implementing the push-relabel method for the maximum flow problem [J].
Cherkassky, BV ;
Goldberg, AV .
ALGORITHMICA, 1997, 19 (04) :390-410
[9]   Resilience of the Internet to random breakdowns [J].
Cohen, R ;
Erez, K ;
ben-Avraham, D ;
Havlin, S .
PHYSICAL REVIEW LETTERS, 2000, 85 (21) :4626-4628
[10]   First-passage times in complex scale-invariant media [J].
Condamin, S. ;
Benichou, O. ;
Tejedor, V. ;
Voituriez, R. ;
Klafter, J. .
NATURE, 2007, 450 (7166) :77-80