Article | Open | Published:

# Morphological organization of point-to-point transport in complex networks

## Abstract

We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied, selects two tree-like structures, one emerging from the source and the other converging to the drain. These trees merge into a large cluster of the remaining nodes that is found to be quasi-equipotential and thus presents almost no resistance to transport. Such a global “tree-cluster-tree” structure is universal and leads to a power law decay of the currents distribution. Its exponent, −2, is determined by the multiplicative decrease of currents at successive branching points of a tree and is found to be independent of the network connectivity degree and resistance distribution.

## Introduction

Transport processes in complex networks play a crucial role in our lives, with examples ranging from transportation networks (e.g. airflight/train connections, international highways, and city transport), electricity distribution networks, microelectronic devices to news propagation and spreading of behaviors in social networks1,2,3,4,5,6,7,8,9,10,11,12. In engineering and biological applications, transport is often electric, hydrodynamic, or diffusive13,14,15,16. During the past two decades, a particular attention has been paid to random networks which can capture major structural properties of complex systems17,18,19,20,21. In particular, scale-free networks, in which the degree distribution follows a power law P(k) kγ with an exponent γ, can model various systems with scaling properties such as citation patterns in science22, internet23, e-mail connections24, to name but a few. Scale-free networks display a variety of interesting transport features found in nature23,25. In particular, the global point-to-point flux Φ in a random scale-free resistor network between two arbitrarily chosen points was shown to obey a distribution with a power law tail: P(Φ)  Φ−(2γ−1)26,27. The degree exponent γ was linked to the scaling of the flux in the line-to-line transport in a resistor network with multiple sources and drains28.

In a typical setting, a particle, an animal, a disease, a virus, a toxin, a signal or a rumor is released at one location and then spreads over the network. To get a theoretical insight onto this phenomenon, a first step is to consider the point-to-point transport between two arbitrary nodes, treated as a source and a drain. In this paper, we investigate the electric transport in a class of scale-free resistor networks, obeying Kirchhoff’s laws or, equivalently, a Markov chain random walk on weighted graphs. This study reveals the structural organization of the nodes potentials and currents in the links. It is found that the density of currents, p(ϕ), decays at large ϕ as a power law with the universal exponent −2. This behavior is attributed to the arborescent structure of links that drive the currents from the source to the drain through a large quasi-equipotential (QEP) cluster of nodes. In other words, the transport between two selected nodes of a network is governed by two random trees, for which the exponent −2 can be justified by theoretical arguments.

## Results

A random scale-free network is constructed on an N × N square lattice. Its links are generated by using an uncorrelated configuration model29 with a given degree exponent γ. To get more insight onto the universal character of the point-to-point transport, we consider the resistance ri,j of each link as a function of the Euclidean distance di,j between the nodes i and j: $${r}_{i,j}={d}_{i,j}^{\beta }$$, with an exponent β. In an electric or hydraulic circuit, the resistance of a wire or a tube is proportional to its length, and β = 1. In turn, most former studies on transport in resistor networks supposed constant link resistance, i.e., β = 0 (see, e.g.26). In each random realization of the resistor network with prescribed exponents γ and β, we select randomly a source node and a drain node, at which the potential is fixed to be 1 and 0, respectively. The system of linear Kirchhoff’s equations30 for the potential on other nodes is solved numerically using a custom routine in Matlab (see Methods section). Then the distributions of nodes potentials and currents in the links are obtained. While we keep using the terminology of electric circuits, the results are valid for diffusive and hydraulic transport as well.

### Universal power-law distribution of currents

The first striking result is that the distribution of currents in a random scale-free resistor network follows a universal power law distribution, that is independent of the degree distribution exponent γ and the resistance-distance exponent β. Figure 1(a) shows that the density of currents is constant at small currents and then decays as a power law with the exponent −2. This probability density admits an excellent fit by the one-sided Cauchy distribution (for ϕ ≥ 0),

$$p(\varphi )=\frac{2}{\pi }\frac{{\varphi }_{m}}{{\varphi }_{m}^{2}+{\varphi }^{2}},$$
(1)

where ϕm is the median current. Interestingly, the mean and the variance of this distribution are infinite for an infinite network, which is a reminiscent property of scale-free systems. The universal power law decay can potentially be related to formerly studied betweenness measures in scale-free networks31,32,33. While the distribution is universal, the median current ϕm depends on the properties of the network (Table 1). The median current ϕm has a relatively weak dependence on γ, as compared to substantial changes of the properties of the scale-free network for various γ. The much stronger dependence on β results from a significant change of the length-dependent resistances: when β = 1, resistances are proportional to inter-node distances and are thus large (yielding small currents); in turn, for β = −1, the resistances are much smaller while the currents are larger. The deviations from the power law decay p(ϕ) ϕ−2 at large currents can be attributed to a finite size of the system. In fact, for any finite-size resistor network, the inter-node distances are bounded from above and below, and thus there exists a minimal resistance and a maximal current. As a consequence, the distribution of currents has a finite support bounded by a maximal cut-off. The cut-off value depends on the exponent β and the size N of the system, and increases as N → ∞. This is clearly seen on Fig. 1(b), which shows the density of currents rescaled by the median current ϕm for N = 50 and N = 100. The rescaling is needed to make closer the densities for two cases because the median current depends on the system size. One can see that the empirical density for the larger system remains close to the theoretical curve up to larger currents, i.e., the cut-off current is larger.

### Morphological organization of the point-to-point transport

To get a deeper insight onto the above transport properties, we study the distribution of the nodes potentials. By construction, the potential varies between 0 (the drain) to 1 (the source). Figure 2(a) shows an example of the potential distribution for one realization of the scale-free network with γ = 2.5 and β = 1. The most striking feature is the very peaked distribution of potentials around a particular value (here, 0.43). In other words, the overwhelming majority of nodes share very close potentials and form thus a quasi-equipotential cluster, which works as an almost perfect conductor. This analysis gives a more precise description of the so-called transport backbone26. While the particular value of the potential of the QEP cluster is specific to the network realization, the very strong concentration around this particular value is universal, being observed for other values of γ and β.

The structural organization of the point-to-point transport is visualized in Fig. 2(b,c). Here the nodes of a scale-free network are elevated in the vertical direction according to their potential. One can distinguish the QEP cluster (the region in the middle), and two arborescent structures, one rooted in the source at the top, and the other rooted in the drain at the bottom. The “terminal branches” of both trees are connected to the QEP cluster and can thus be considered as grounded to the potential of the QEP cluster. This structural organization allows one to treat the point-to-point transport on networks as a series connection of two random trees. As the electric properties of a tree can be determined via exact recursive computations (see below), this is a tremendous simplification of the original problem. We will show how this discovery brings new conceptual understanding of the point-to-point transport on networks and a rational for the observed universality in the currents distribution. The almost flat region of the density of currents in Fig. 1 can be attributed to the small currents in links between the numerous nodes and loops of the QEP cluster. In turn, the larger currents flow in two trees (see Fig. 2(b,c)) and produce a power law decay of the currents distribution. This is typical for a tree, in which the largest current in the trunk is progressively divided in a large number of smaller currents following the successive branching points. As both trees are connected to the QEP cluster, they can be treated independently.

### Recursive computation for a tree

For an arbitrary resistors tree, in which all terminal branches are grounded (set to a potential V0) and a given potential V1 is applied to the root, the currents and potentials can be computed via an exact recursive procedure. In fact, for any terminal branch, one can identify its mother node and all sister nodes (Fig. 3). If r1, …, rm denote the resistances of the links from these terminal branches to their mother node, and r0 is the resistance of the link from the mother node to its mother node, then the overall resistance of this group is simply R = r0 + 1/(1/r1 + … + 1/rm). As a consequence, this group of links can be replaced by a single effective link with the resistance R. Repeating this replacement procedure from the most distant terminal branches and progressing toward the root, we can compute the total resistance of the tree Rtree, from which we get the local current (V1 − V0)/Rtree at an effective link representing the whole tree, and the potential drops at the daughter nodes. Considering now each daughter node as the root of the corresponding subtree, one can repeat the computation. Descending recursively from the root to the most distant terminal branches, one evaluates all currents and potentials.

At any level, once the potential V at the mother of the mother node is evaluated for a given group, we can compute the current ϕ0 = V/R, the potential

$$V^{\prime} =V-{\varphi }_{0}{r}_{0}=V(1-{r}_{0}/R)=\frac{V}{1+\frac{{r}_{0}}{{r}_{1}}+\ldots +\frac{{r}_{0}}{{r}_{m}}},$$

and the currents ϕi = V′/ri at each link. If the resistances ri are comparable to each other, then the currents ϕi in the links to daughter nodes are approximately m + 1 times smaller than the current ϕ0, while the number of such currents is m times larger. Most importantly, due to the arborescent character of the structure, this reduction of currents is repeated multiplicatively at all branching levels. Therefore, the probability that the local current $$\hat{\varphi }$$ at a randomly chosen link exceeds a prescribed value ϕ, is dominated by the relative fraction of links with the current of order ϕ, which is inversely proportional to ϕ. In other words, $${\mathbb{P}}\{\hat{\varphi }\ge \varphi \}\propto 1/\varphi$$, from which the scaling ϕ−2 of the probability density p(ϕ) follows immediately. These qualitative arguments are confirmed by a more rigorous computation for some classes of random trees (see Methods section) and by numerical simulations for various random trees (see Fig. 4).

## Discussion

The emergence of a “working tree” in a complex network is not a surprise since the currents follow the links that were built independently of the choice of source and drain. Starting for the source node, there exits a finite number of links leading to other nodes. At this stage there are no loops. Then starting from these new nodes, one finds new links but the probability of creating loops is very small because the great majority of the support sites are free for new links. This process builds progressively a tree structure up to the situation where loops are necessarily created when the number of tree sites is comparable to total number of support sites. This is why the numerical simulations shown in Fig. 4 have been limited to a total number of tree nodes between 1/10 and 1/3 of the total number of sites of the support lattice.

While our discussion was focused on electric currents and potentials, the discovered morphological organization of point-to-point transport is relevant for other phenomena. For instance, steady-state diffusion of particles from a source to a sink is governed by the Laplace equation whose discretization on a given graph yields a set of linear equations similar to the Kirchhoff’s equations. In this setting, electric potentials and currents are substituted by concentrations of particles and their fluxes, respectively. Moreover, when the source concentration is set to 1, concentration at a given point can alternatively be interpreted as the splitting probability that a particle started from that point hits the source point before hitting the drain point. In other words, it characterizes the relative “accessibilities” of a source and a drain from different points of the graph34.

In summary, the application of a potential difference at two randomly chosen points of a scale-free network determines a transport structure composed of two random trees (rooted at these two points) connected through a quasi-equipotential cluster. Small currents between the nodes of this cluster form the plateau region of the density of currents. The arborescent character of the resistant part of this structure implies the multiplicative reduction of the currents in these trees and thus a power law decay of the density of currents with the universal exponent −2. Whatever the rules of construction of a scale-free network (e.g. the choice of β and γ), the density of currents exhibits the same decay. Note that similar structural organizations of the point-to-point transport are found in various natural and human-engineered complex systems: human vascular network (with an artery splitting progressively into numerous capillaries and then merging again to few veins), braided river networks35,36, water supply networks and irrigation systems (with one or several water intake stations supplying a branching network of pipes and then merging again to one or several sewage disposal points), to name but a few. Here, we showed that such a structural organization is formed spontaneously in a scale-free network by applying the potential difference to two arbitrary points. This observation is expected to help to understand the morphology, optimality, and robustness of natural point-to-point transport systems. An extension of this study to other types of complex networks such as small-world graphs, presents an interesting perspective for future research. More generally, our interpretation in terms of arborescent structure of links that drive the currents from source to drain through a large QEP cluster of nodes opens the door to aggregate conceptualizations of transport processes in complex networks.

## Methods

### Description of the numerical scheme

Numerical simulations of the scale-free resistor networks are performed using MATLAB 9.2 (R2017a). The source (potential set to 1) and drain (potential set to 0) nodes are randomly picked among nodes that are separated by a distance of at least 4 nodes. The system of linear Kirchhoff’s equations30, excluding the source and drain nodes, reads in a matrix form as M × P = S, where P is the column vector of all N − 2 unknown potentials, M is the (N − 2) × (N − 2) matrix of coefficients, and S is the column vector of N − 2 elements, where each element corresponds to the total flow exiting the current node j and satisfying the conservation of mass equation. The system is solved using the typical “mldivide” (or backslash) operator in MATLAB, that computes the solution P using LU decomposition. Knowing the potential P, one can then compute the current for each link.

### Computation of current distribution on a tree

We discuss two examples of trees for illustrating the general arguments of the main text about the distribution of currents.

First, we consider a regular tree with N levels of branching, in which each node (except the root) is divided into q daughter branches. We select the root node as the source and all terminal nodes as a drain. The correspondence to the point-to-point transport can be made by merging this tree to its copy (“reflected tree”) by connecting pairwise all terminal nodes. In that case, the root of the reflected tree is set as the drain. The distribution of currents is the same in both cases due to the symmetry. As this network is deterministic, the currents are as well deterministic, so that one can understand the distribution of currents in terms of frequencies of observation of a given value of the current. Clearly, such a distribution is discrete.

Due to the symmetry, currents in all branches of a given level are identical. If ϕ0 denotes the current in the root branch (of level 0), which is single by construction, then the current in any branch of the level n is just ϕ0/qn, where qn is the number of branches at this level. Then the probability (interpreted as the frequency of occurrence) for the current $$\hat{\varphi }$$ in a randomly selected branch is

$${P}_{n}={\mathbb{P}}\{\hat{\varphi }={\varphi }_{0}/{q}^{n}\}=\frac{{q}^{n}}{1+q+\ldots +{q}^{N-1}}\,,$$
(2)

from which, denoting ϕ = ϕ0/qn, one has

$${\mathbb{P}}\{\hat{\varphi }\ge \varphi \}={P}_{0}+{P}_{1}+\ldots +{P}_{n}=\frac{q{\varphi }_{0}/\varphi -1}{{q}^{N}-1}.$$
(3)

Formally treating ϕ as a continuous variable, one finds that the corresponding probability density function bahaves as

$$p(\varphi )=-\frac{\partial {\mathbb{P}}\{\hat{\varphi }\ge \varphi \}}{\partial \varphi }\propto \frac{1}{{\varphi }^{2}}.$$
(4)

This computation can be extended a nonregular tree, in which the number qn of daughter branches depends on the branching level n. Repeating the above arguments, one gets

$${\mathbb{P}}\{\hat{\varphi }\ge \varphi \}=A(1+{q}_{1}+{q}_{1}{q}_{2}+\ldots +{q}_{1}{q}_{2}\cdots {q}_{n}),$$
(5)

where ϕ = ϕ0/(q1q2qn), and A = 1 + q1 + q1q2 + … + q1q2qN−1 is the normalization constant. Since all qn ≥ 2, one can easily prove that the last term, q1q2qn, provides the dominant contribution to this sum. In other words, the contribution of the remaining terms is either smaller or comparable to the last term. In fact, the following inequality holds

$$1+{q}_{1}+{q}_{1}{q}_{2}+\ldots +{q}_{1}{q}_{2}\cdots {q}_{n-1}\le {q}_{1}{q}_{2}\cdots {q}_{n}.$$
(6)

To prove it, one can divide both sides by q1q2qn−1 and check that

$$\frac{1}{{q}_{1}{q}_{2}\cdots {q}_{n-1}}+\ldots +\frac{1}{{q}_{n-1}}+1\le \frac{1}{{2}^{n-1}}+\ldots +\frac{1}{2}+1=2(1-{(1/2)}^{n})\le 2\le {q}_{n}.$$

As a consequence, $${\mathbb{P}}\{\hat{\varphi }\ge \varphi \}\propto 1/\varphi$$, and thus one gets again the scaling exponent −2 for the current density.

## Data Availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

1. 1.

Amaral, L. A. N., Scala, A., Berthelemy, M. & Stanley, H. E. Classes of small-world networks. Proc. Natl. Acad. Sci. USA 97, 11149 (2000).

2. 2.

Havlin, S. & Cohen, R. Complex Networks: Structure, Robustness and Function. (Cambridge University Press, 2010).

3. 3.

Pastor-Satorras, R. & Vespignani, A. Structure and Evolution of the Internet: A Statistical Physics Approach. (Cambridge University Press, Cambridge, 2004).

4. 4.

Caldarelli, G. & Vespignani, A. Large Scale Structure and Dynamics of Complex Webs. (World Scientific, Singapore, 2007).

5. 5.

Condamin, S., Bénichou, O., Tejedor, V., Voituriez, R. & Klafter, J. First-passage time in complex scale-invariant media. Nature 450, 77 (2007).

6. 6.

Gallos, L. K., Song, C., Havlin, S. & Makse, H. A. Scaling theory of transport in complex biological networks. Proc. Nat. Acad. Sci. USA 104, 7746 (2007).

7. 7.

Corson, F. Fluctuations and Redundancy in Optimal Transport Networks. Phys. Rev. Lett. 104, 048703 (2010).

8. 8.

Li, G. et al. Towards Design Principles for Optimal Transport Networks. Phys. Rev. Lett. 104, 018701 (2010).

9. 9.

Mülken, O. & Blumen, A. Continuous-time quantum walks: Models for coherent transport on complex networks. Phys. Rep. 502, 37–87 (2011).

10. 10.

Nicolaides, C., Cueto-Felgueroso, L., González, M. C. & Juanes, R. A metric of influential spreading during contagion dynamics through the air transportation network. Plos one 7(7), e40961 (2012).

11. 11.

Aral, S. & Nicolaides, C. Exercise contagion in a global social network. Nature Comm. 8, 14753 (2017).

12. 12.

Verma, T., Araújo, N. A. M. & Herrmann, H. J. Revealing the structure of the world airline network. Sci. Rep. 4, 05638 (2014).

13. 13.

Neufeld, Z. & Hernandez-Garcia, E. Chemical and Biological Processes in Fluid Flows. A dynamical systems approach. (Imperial College Press, 2009).

14. 14.

Mauroy, B., Filoche, M., Weibel, E. & Sapoval, B. An Optimal Bronchial Tree May Be Dangerous. Nature 427, 633–636 (2004).

15. 15.

Grebenkov, D. S., Filoche, M., Sapoval, B. & Felici, M. Diffusion-Reaction in Branched Structures: Theory and Application to the Lung Acinus. Phys. Rev. Lett. 94, 050602 (2005).

16. 16.

Hu, D. & Cai, D. Adaptation and Optimization of Biological Transport Networks. Phys. Rev. Lett. 111, 138701 (2013).

17. 17.

Albert, R. & Barabási, A.-L. Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 74, 47–97 (2002).

18. 18.

Goh, K.-I., Oh, E., Jeong, H., Kahng, B. & Kim, D. Classification of scale-free networks. Proc. Nat. Acad. Sci. USA 99, 12583 (2002).

19. 19.

Pastor-Satorras, R. & Vespignani, A. Evolution and structure of the Internet: A statistical physics approach. (Cambridge University Press, New York, 2003).

20. 20.

Gallos, L. K., Song, C., Havlin, S. & Makse, H. A. A review of fractality and self-similarity in complex networks. Physica A 386, 686 (2007).

21. 21.

Radicchi, F. & Castellano, C. Beyond the locally treelike approximation for percolation on real networks. Phys. Rev. E 93, 030302 (2016).

22. 22.

Barabasi, A. L. & Albert, R. Emergence of scaling in random networks. Science 286, 509 (1999).

23. 23.

Dorogovtsev, S. N., Goltsev, A. V. & Mendes, J. F. F. Pseudofractal scale-free web. Phys. Rev. E 65, 066122 (2002).

24. 24.

Seyed-Allaei, H., Bianconi, G. & Marsili, M. Scale-free networks with an exponent less than two. Phys. Rev. E 73, 046113 (2006).

25. 25.

Bollt, E. M. & ben Avraham, D. What is special about diffusion on scale-free nets? New J. Phys. 7, 26 (2005).

26. 26.

Lopez, E., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Anomalous transport in complex networks. Phys. Rev. Lett. 94, 248701 (2005).

27. 27.

Carmi, S., Wu, Z., Havlin, S. & Stanley, H. E. Transport in networks with multiple sources and sinks. EPL 84, 28005 (2008).

28. 28.

Nicolaides, C., Cueto-Felgueroso, L. & Juanes, R. Anomalous physical transport in complex networks. Phys. Rev. E 82, 055101(R) (2010).

29. 29.

Catanzaro, M., Boguna, M. & Pastor-Satorras, R. Generation of uncorrelated random scale-free networks. Phys. Rev. E 71, 027103 (2005).

30. 30.

Redner, S. A Guide to First-Passage Processes (Cambridge University Press, 2001).

31. 31.

Freeman, L. A Set of Measures of Centrality Based on Betweenness. Sociometry 40, 35–41 (1977).

32. 32.

Barthelemy, M. Betweenness centrality in large complex networks. Eur. Phys. J. B 38, 163–168 (2004).

33. 33.

Newman, M. E. A measure of betweenness centrality based on random walks. Soc. Netw. 27, 39 (2005).

34. 34.

Grebenkov, D. S. What Makes a Boundary Less Accessible. Phys. Rev. Lett. 95, 200602 (2005).

35. 35.

Rinaldo, A., Rigon, R., Banavar, J. R., Maritan, A. & Rodriguez-Iturbe, I. Evolution and selection of river networks: Statics, dynamics, and complexity. Proc. Nat. Acad. Sci. USA 111, 2417–2424 (2014).

36. 36.

Connor-Streich, G., Henshaw, A. J., Brasington, J., Bertoldi, W. & Harvey, G. L. Let’s get connected: A new graph theory-based approach and toolbox for understanding braided river morphodynamics. WIREs Water 5, e1296 (2018).

## Acknowledgements

C.N. acknowledges support from the University of Cyprus, through a starting grant.

## Author information

B.S., C.N. and D.S.G. conceived the research project, M.Y.K., G.B. and L.T. performed numerical computations, J.F.C., D.S.G. and G.B. prepared figures, D.S.G. and M.Y.K. analyzed the results, D.S.G., B.S., L.T., M.Y.K. and G.B. wrote the manuscript. All authors reviewed the manuscript.

### Competing Interests

The authors declare no competing interests.

Correspondence to Denis S. Grebenkov.