Related papers: Transport of multiple users in complex networks
We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…
To study transport properties of complex networks, we analyze the equivalent conductance $G$ between two arbitrarily chosen nodes of random scale-free networks with degree distribution $P(k)\sim k^{-\lambda}$ in which each link has the same…
We study the distribution $P(\sigma)$ of the equivalent conductance $\sigma$ for Erd\H{o}s-R\'enyi (ER) and scale-free (SF) weighted resistor networks with $N$ nodes. Each link has conductance $g\equiv e^{-ax}$, where $x$ is a random number…
Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of the source and drain nodes can affect transport subject to…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applications. However, it is a property that is not well-understood…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…
The load of a node in a network is the total traffic going through it when every node pair sustains a uniform bidirectional traffic between them on shortest paths. We show that nodal load can be expressed in terms of the more elementary…
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We have empirically observed that the distribution of lengths…
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,…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of…
We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons. The underlying network is a…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
This paper is concerned with the characterization of the relationship between topology and traffic dynamics. We use a model of network generation that allows the transition from random to scale free networks. Specifically, we consider three…
Major cities worldwide experience problems with the performance of their road transportation networks, and the continuous increase in traffic demand presents a substantial challenge to the optimal operation of urban road networks and the…
To analyze the transport of information or material from a source to every node of a network we use two quantities introduced in the study of river networks: the cost and the flow. For a network with $K$ nodes and $M$ levels, we show that…
Recently, motivated by the pioneer works in revealing the small-world effect and scale-free property of various real-life networks, many scientists devote themselves to studying complex networks. In this paper, we give a brief review on the…