Transport in networks with multiple sources and sinks(12 May 2008)
|
Reviews
[Write a review of this article]
There are no reviews of this article
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
摘要We study 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 change in 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. Finally we show that for the common case where the transport takes place between specific pairs of sources and sinks, a percolation approach can be applied to calculate the total flow and predict the number of sources/sinks above which the network saturates and can carry no more flow.
BibTeX record
RIS record