Related papers: The Flow Dimension and Capacity for Structuring Ur…
This letter deals with the controllability issue of complex networks. An index is chosen to quantitatively measure the extent of controllability of given network. The effect of this index is analyzed based on empirical studies on various…
We investigated the scaling and topology of engineered urban drainage networks (UDNs) in two cities, and further examined UDN evolution over decades. UDN scaling was analyzed using two power-law characteristics widely employed for river…
We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…
In communication networks structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and…
Urban streets are hierarchically organized in the sense that a majority of streets are trivial, while a minority of streets is vital. This hierarchy can be simply, but elegantly, characterized by the 80/20 principle, i.e. 80 percent of…
We analyze the structure of networks minimizing the global resistance to flow (or dissipated energy) with respect to two different constraints: fixed total channel volume and fixed total channel surface area. First, we determine the shape…
The efficient computation of shortest paths in complex networks is essential to face new challenges related to critical infrastructures such as a near real-time monitoring and control and the management of big size systems. In particular,…
We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of…
We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We show that when $X$ is a singleton, that number equals the…
Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information…
Many complex networks, ranging from social to biological systems, exhibit structural patterns consistent with an underlying hyperbolic geometry. Revealing the dimensionality of this latent space can disentangle the structural complexity of…
This article investigates the performance of grid computing systems whose interconnections are given by random and scale-free complex network models. Regular networks, which are common in parallel computing architectures, are also used as a…
We analyse two large-scale intra-city urban networks and traffic flows therein measured by GPS traces of taxis in San Francisco and Shanghai. Our results coincide with previous findings that, based purely on topological means, it is often…
Reducing dimension redundancy to find simplifying patterns in high-dimensional datasets and complex networks has become a major endeavor in many scientific fields. However, detecting the dimensionality of their latent space is challenging…
Networks are universally considered as complex structures of interactions of large multi-component systems. In order to determine the role that each node has inside a complex network, several centrality measures have been developed. Such…
Data-driven analysis of large social networks has attracted a great deal of research interest. In this paper, we investigate 120 real social networks and their measurement-calibrated synthetic counterparts generated by four well-known…
The macroscopic fundamental diagram (MFD) is a large scale description of the traffic in a urban area and relates the average car flow to the average car density. This MFD has been observed empirically in several cities but how its…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the…
Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the…