Modeling urban street patterns

Urban streets patterns form planar networks whose empirical properties cannot be accounted for by simple models such as regular grids or Voronoi tesselations. Striking statistical regularities across different cities have been recently empirically found, suggesting that a general and details-independent mechanism may be in action. We propose a simple model based on a local optimization process combined with ideas previously proposed in studies of leaf pattern formation. The statistical properties of this model are in good agreement with the observed empirical patterns. Our results thus suggests that in the absence of a global design strategy, the evolution of many different transportation networks indeed follow a simple universal mechanism.Comment: 4 pages, 5 figures, final version published in PR

Epidemic variability in complex networks

We study numerically the variability of the outbreak of diseases on complex networks. We use a SI model to simulate the disease spreading at short times, in homogeneous and in scale-free networks. In both cases, we study the effect of initial conditions on the epidemic's dynamics and its variability. The results display a time regime during which the prevalence exhibits a large sensitivity to noise. We also investigate the dependence of the infection time on nodes' degree and distance to the seed. In particular, we show that the infection time of hubs have large fluctuations which limit their reliability as early-detection stations. Finally, we discuss the effect of the multiplicity of shortest paths between two nodes on the infection time. Furthermore, we demonstrate that the existence of even longer paths reduces the average infection time. These different results could be of use for the design of time-dependent containment strategies

Co-evolution of density and topology in a simple model of city formation

We study the influence that population density and the road network have on each others' growth and evolution. We use a simple model of formation and evolution of city roads which reproduces the most important empirical features of street networks in cities. Within this framework, we explicitely introduce the topology of the road network and analyze how it evolves and interact with the evolution of population density. We show that accessibility issues -pushing individuals to get closer to high centrality nodes- lead to high density regions and the appearance of densely populated centers. In particular, this model reproduces the empirical fact that the density profile decreases exponentially from a core district. In this simplified model, the size of the core district depends on the relative importance of transportation and rent costs.Comment: 13 pages, 13 figure

The Swiss Board Directors Network in 2009

We study the networks formed by the directors of the most important Swiss boards and the boards themselves for the year 2009. The networks are obtained by projection from the original bipartite graph. We highlight a number of important statistical features of those networks such as degree distribution, weight distribution, and several centrality measures as well as their interrelationships. While similar statistics were already known for other board systems, and are comparable here, we have extended the study with a careful investigation of director and board centrality, a k-core analysis, and a simulation of the speed of information propagation and its relationships with the topological aspects of the network such as clustering and link weight and betweenness. The overall picture that emerges is one in which the topological structure of the Swiss board and director networks has evolved in such a way that special actors and links between actors play a fundamental role in the flow of information among distant parts of the network. This is shown in particular by the centrality measures and by the simulation of a simple epidemic process on the directors network.Comment: Submitted to The European Physical Journal

Statistical Analysis of the Road Network of India

In this paper we study the Indian Highway Network as a complex network where the junction points are considered as nodes, and the links are formed by an existing connection. We explore the topological properties and community structure of the network. We observe that the Indian Highway Network displays small world properties and is assortative in nature. We also identify the most important road-junctions (or cities) in the highway network based on the betweenness centrality of the node. This could help in identifying the potential congestion points in the network. Our study is of practical importance and could provide a novel approach to reduce congestion and improve the performance of the highway networ

Gravity model in the Korean highway

We investigate the traffic flows of the Korean highway system, which contains both public and private transportation information. We find that the traffic flow T(ij) between city i and j forms a gravity model, the metaphor of physical gravity as described in Newton's law of gravity, P(i)P(j)/r(ij)^2, where P(i) represents the population of city i and r(ij) the distance between cities i and j. It is also shown that the highway network has a heavy tail even though the road network is a rather uniform and homogeneous one. Compared to the highway network, air and public ground transportation establish inhomogeneous systems and have power-law behaviors.Comment: 13 page

Two-dimensional SIR epidemics with long range infection

We extend a recent study of susceptible-infected-removed epidemic processes with long range infection (referred to as I in the following) from 1-dimensional lattices to lattices in two dimensions. As in I we use hashing to simulate very large lattices for which finite size effects can be neglected, in spite of the assumed power law $p({\bf x})\sim |{\bf x}|^{-\sigma-2}$ for the probability that a site can infect another site a distance vector ${\bf x}$ apart. As in I we present detailed results for the critical case, for the supercritical case with $\sigma = 2$, and for the supercritical case with $0< \sigma < 2$. For the latter we verify the stretched exponential growth of the infected cluster with time predicted by M. Biskup. For $\sigma=2$ we find generic power laws with $\sigma-$dependent exponents in the supercritical phase, but no Kosterlitz-Thouless (KT) like critical point as in 1-d. Instead of diverging exponentially with the distance from the critical point, the correlation length increases with an inverse power, as in an ordinary critical point. Finally we study the dependence of the critical exponents on $\sigma$ in the regime $0<\sigma <2$, and compare with field theoretic predictions. In particular we discuss in detail whether the critical behavior for $\sigma$ slightly less than 2 is in the short range universality class, as conjectured recently by F. Linder {\it et al.}. As in I we also consider a modified version of the model where only some of the contacts are long range, the others being between nearest neighbors. If the number of the latter reaches the percolation threshold, the critical behavior is changed but the supercritical behavior stays qualitatively the same.Comment: 14 pages, including 29 figure

Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency

Motivated by synchronization problems in noisy environments, we study the Edwards-Wilkinson process on weighted uncorrelated scale-free networks. We consider a specific form of the weights, where the strength (and the associated cost) of a link is proportional to $(k_{i}k_{j})^{\beta}$ with $k_{i}$ and $k_{j}$ being the degrees of the nodes connected by the link. Subject to the constraint that the total network cost is fixed, we find that in the mean-field approximation on uncorrelated scale-free graphs, synchronization is optimal at $\beta^{*}$$=$-1. Numerical results, based on exact numerical diagonalization of the corresponding network Laplacian, confirm the mean-field results, with small corrections to the optimal value of $\beta^{*}$. Employing our recent connections between the Edwards-Wilkinson process and resistor networks, and some well-known connections between random walks and resistor networks, we also pursue a naturally related problem of optimizing performance in queue-limited communication networks utilizing local weighted routing schemes.Comment: Papers on related research can be found at http://www.rpi.edu/~korniss/Research

A universal model for mobility and migration patterns

Introduced in its contemporary form by George Kingsley Zipf in 1946, but with roots that go back to the work of Gaspard Monge in the 18th century, the gravity law is the prevailing framework to predict population movement, cargo shipping volume, inter-city phone calls, as well as bilateral trade flows between nations. Despite its widespread use, it relies on adjustable parameters that vary from region to region and suffers from known analytic inconsistencies. Here we introduce a stochastic process capturing local mobility decisions that helps us analytically derive commuting and mobility fluxes that require as input only information on the population distribution. The resulting radiation model predicts mobility patterns in good agreement with mobility and transport patterns observed in a wide range of phenomena, from long-term migration patterns to communication volume between different regions. Given its parameter-free nature, the model can be applied in areas where we lack previous mobility measurements, significantly improving the predictive accuracy of most of phenomena affected by mobility and transport processes.Comment: Main text and supplementary informatio