Transport in networks with multiple sources and sinks

Details Transport in networks with multiple sources and sinks Transport in networks with multiple sources and sinks

2008-05-12

arxiv.org/abs/0805.1567v2

Europhys. Lett. 84, 28005 (2008)

Computer Science

Discrete Mathematics

Scientific paper

10.1209/0295-5075/84/28005

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.

Affiliated with

Also associated with

No associations

Rating

Transport in networks with multiple sources and sinks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Transport in networks with multiple sources and sinks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transport in networks with multiple sources and sinks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324565