Optimal Traffic Networks

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by a strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.Comment: 4 pages, 4 figures, final revised versio

The Price of Anarchy in Transportation Networks: Efficiency and Optimality Control

Uncoordinated individuals in human society pursuing their personally optimal strategies do not always achieve the social optimum, the most beneficial state to the society as a whole. Instead, strategies form Nash equilibria which are often socially suboptimal. Society, therefore, has to pay a price of anarchy for the lack of coordination among its members. Here we assess this price of anarchy by analyzing the travel times in road networks of several major cities. Our simulation shows that uncoordinated drivers possibly waste a considerable amount of their travel time. Counterintuitively,simply blocking certain streets can partially improve the traffic conditions. We analyze various complex networks and discuss the possibility of similar paradoxes in physics.Comment: major revisions with multicommodity; Phys. Rev. Lett., accepte

The effects of spatial constraints on the evolution of weighted complex networks

Motivated by the empirical analysis of the air transportation system, we define a network model that includes geographical attributes along with topological and weight (traffic) properties. The introduction of geographical attributes is made by constraining the network in real space. Interestingly, the inclusion of geometrical features induces non-trivial correlations between the weights, the connectivity pattern and the actual spatial distances of vertices. The model also recovers the emergence of anomalous fluctuations in the betweenness-degree correlation function as first observed by Guimer\`a and Amaral [Eur. Phys. J. B {\bf 38}, 381 (2004)]. The presented results suggest that the interplay between weight dynamics and spatial constraints is a key ingredient in order to understand the formation of real-world weighted networks

Optimal spatial transportation networks where link-costs are sublinear in link-capacity

Consider designing a transportation network on $n$ vertices in the plane, with traffic demand uniform over all source-destination pairs. Suppose the cost of a link of length $\ell$ and capacity $c$ scales as $\ell c^\beta$ for fixed $0<\beta<1$. Under appropriate standardization, the cost of the minimum cost Gilbert network grows essentially as $n^{\alpha(\beta)}$, where $\alpha(\beta) = 1 - \frac{\beta}{2}$ on $0 < \beta \leq {1/2}$ and $\alpha(\beta) = {1/2} + \frac{\beta}{2}$ on ${1/2} \leq \beta < 1$. This quantity is an upper bound in the worst case (of vertex positions), and a lower bound under mild regularity assumptions. Essentially the same bounds hold if we constrain the network to be efficient in the sense that average route-length is only $1 + o(1)$ times average straight line length. The transition at $\beta = {1/2}$ corresponds to the dominant cost contribution changing from short links to long links. The upper bounds arise in the following type of hierarchical networks, which are therefore optimal in an order of magnitude sense. On the large scale, use a sparse Poisson line process to provide long-range links. On the medium scale, use hierachical routing on the square lattice. On the small scale, link vertices directly to medium-grid points. We discuss one of many possible variant models, in which links also have a designed maximum speed $s$ and the cost becomes $\ell c^\beta s^\gamma$.Comment: 13 page

Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that

We report on some recent developments in the search for optimal network topologies. First we review some basic concepts on spectral graph theory, including adjacency and Laplacian matrices, and paying special attention to the topological implications of having large spectral gaps. We also introduce related concepts as ``expanders'', Ramanujan, and Cage graphs. Afterwards, we discuss two different dynamical feautures of networks: synchronizability and flow of random walkers and so that they are optimized if the corresponding Laplacian matrix have a large spectral gap. From this, we show, by developing a numerical optimization algorithm that maximum synchronizability and fast random walk spreading are obtained for a particular type of extremely homogeneous regular networks, with long loops and poor modular structure, that we call entangled networks. These turn out to be related to Ramanujan and Cage graphs. We argue also that these graphs are very good finite-size approximations to Bethe lattices, and provide almost or almost optimal solutions to many other problems as, for instance, searchability in the presence of congestion or performance of neural networks. Finally, we study how these results are modified when studying dynamical processes controlled by a normalized (weighted and directed) dynamics; much more heterogeneous graphs are optimal in this case. Finally, a critical discussion of the limitations and possible extensions of this work is presented.Comment: 17 pages. 11 figures. Small corrections and a new reference. Accepted for pub. in JSTA

Fluctuation-driven capacity distribution in complex networks

Maximizing robustness and minimizing cost are common objectives in the design of infrastructure networks. However, most infrastructure networks evolve and operate in a highly decentralized fashion, which may significantly impact the allocation of resources across the system. Here, we investigate this question by focusing on the relation between capacity and load in different types of real-world communication and transportation networks. We find strong empirical evidence that the actual capacity of the network elements tends to be similar to the maximum available capacity, if the cost is not strongly constraining. As more weight is given to the cost, however, the capacity approaches the load nonlinearly. In particular, all systems analyzed show larger unoccupied portions of the capacities on network elements subjected to smaller loads, which is in sharp contrast with the assumptions involved in (linear) models proposed in previous theoretical studies. We describe the observed behavior of the capacity-load relation as a function of the relative importance of the cost by using a model that optimizes capacities to cope with network traffic fluctuations. These results suggest that infrastructure systems have evolved under pressure to minimize local failures, but not necessarily global failures that can be caused by the spread of local damage through cascading processes

World citation and collaboration networks: uncovering the role of geography in science

Modern information and communication technologies, especially the Internet, have diminished the role of spatial distances and territorial boundaries on the access and transmissibility of information. This has enabled scientists for closer collaboration and internationalization. Nevertheless, geography remains an important factor affecting the dynamics of science. Here we present a systematic analysis of citation and collaboration networks between cities and countries, by assigning papers to the geographic locations of their authors' affiliations. The citation flows as well as the collaboration strengths between cities decrease with the distance between them and follow gravity laws. In addition, the total research impact of a country grows linearly with the amount of national funding for research & development. However, the average impact reveals a peculiar threshold effect: the scientific output of a country may reach an impact larger than the world average only if the country invests more than about 100,000 USD per researcher annually.Comment: Published version. 9 pages, 5 figures + Appendix, The world citation and collaboration networks at both city and country level are available at http://becs.aalto.fi/~rajkp/datasets.htm

Feasibility study for future use of the Bostwick property

University of Maryland School of Architecture, Planning & Preservation, Graduate Program in Historic Preservation, December 2011. HISP 650Since its construction in 1746, Bostwick has been a constant presence in Bladensburg, Maryland. It has survived as a standing structure with several acres of intact historic landscape, while the built environment of the surrounding area has evolved. The original structure, many of the historic outbuildings, and the landscape remain, but throughout its history Bostwick’s buildings and landscape have changed in appearance, function, and its relationship to the local community. Today, the property is physically deteriorating, and damage from the August 2011 earthquake has only made the situation worse. It has become a problem for both its owner, the Town of Bladensburg, and the greater preservation community. All involved are interested in Bostwick’s survival, and all agree that its potential future use could be the cornerstone in Bladensburg’s continuing development. As part of an ongoing relationship between the University of Maryland and the Town, this studio project was developed to explore recommendations for a new use of Bostwick. The recommended scenario builds upon the strengths of the Bladensburg community and the unique heritage of Bostwick. This report is divided into two parts: (1) Research & Assessment and (2) Recommendations. Part 1 details all of our research, including the past and present context of both Bostwick and greater Bladensburg, previous preservation efforts and studies, stakeholder values, and comparable sites. All of this data informs Part 2 of this report, which contains our recommendations for the future use of Bostwick

Predicting Missing Links via Local Information

Missing link prediction of networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well-known local similarity measures on six real networks. The results indicate that the simplest measure, namely common neighbors, has the best overall performance, and the Adamic-Adar index performs the second best. A new similarity measure, motivated by the resource allocation process taking place on networks, is proposed and shown to have higher prediction accuracy than common neighbors. It is found that many links are assigned same scores if only the information of the nearest neighbors is used. We therefore design another new measure exploited information of the next nearest neighbors, which can remarkably enhance the prediction accuracy.Comment: For International Workshop: "The Physics Approach To Risk: Agent-Based Models and Networks", http://intern.sg.ethz.ch/cost-p10

Urban road networks -- Spatial networks with universal geometric features? A case study on Germany's largest cities

Urban road networks have distinct geometric properties that are partially determined by their (quasi-) two-dimensional structure. In this work, we study these properties for 20 of the largest German cities. We find that the small-scale geometry of all examined road networks is extremely similar. The object-size distributions of road segments and the resulting cellular structures are characterised by heavy tails. As a specific feature, a large degree of rectangularity is observed in all networks, with link angle distributions approximately described by stretched exponential functions. We present a rigorous statistical analysis of the main geometric characteristics and discuss their mutual interrelationships. Our results demonstrate the fundamental importance of cost-efficiency constraints for in time evolution of urban road networks.Comment: 16 pages; 8 figure