Transport in networks with multiple sources and sinks
| dc.creator | Carmi, Shai | |
| dc.creator | Wu, Zhenhua | |
| dc.creator | Havlin, Shlomo | |
| dc.creator | Stanley, H. Eugene | |
| dc.date | 2008-05-12 | |
| dc.date | 2008-11-17 | |
| dc.date.accessioned | 2026-07-07T10:18:16Z | |
| dc.date.available | 2026-07-07T10:18:16Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0805.1567 | |
| dc.identifier | http://arxiv.org/abs/0805.1567 | |
| dc.identifier | Europhys. Lett. 84, 28005 (2008) | |
| dc.identifier | doi:10.1209/0295-5075/84/28005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174135 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | Transport in networks with multiple sources and sinks | |
| dc.type | text |