Related papers: Scaling Laws in Chennai Bus Network
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent $\eta$. We find that for trees or networks with a small loop density $\eta=2$…
The rate equations are used to study the scale-free behavior of the weight distribution in evolving networks whose topology is determined only by degrees of preexisting vertices. An analysis of these equations shows that the degree…
We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas…
Most of various large-size complex systems in nature and society can be well described as complex networks (graphs) to better understand the evolutional mechanisms and dynamical functions behind themselves. Of some part follow scale-free…
We model information traffic on scale-free networks by introducing the bandwidth as the delivering ability of links. We focus on the effects of bandwidth on the packet delivering ability of the traffic system to better understand traffic…
Complex network theory crucially depends on the assumptions made about the degree distribution, while fitting degree distributions to network data is challenging, in particular for scale-free networks with power-law degrees. We present a…
We study the avalanche dynamics in the data packet transport on scale-free networks through a simple model. In the model, each vertex is assigned a capacity proportional to the load with a proportionality constant $1+a$. When the system is…
In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-\gamma}$ under a boolean dynamic, where the boolean rule that each node obeys is a function of its connectivity $k$. This is done by using only two…
We study the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from a ward to another. Remarkably the in-strength and in-degree…
Designing and optimizing the structure of urban transportation networks is a challenging task. In this study, we propose a method inspired by optimal transport theory and the principle of economy of scale that uses little information in…
Large scale simulations of the movements of people in a ``virtual'' city and their analyses are used to generate new insights into understanding the dynamic processes that depend on the interactions between people. Models, based on these…
Recurrence networks are a novel tool of nonlinear time series analysis allowing the characterisation of higher-order geometric properties of complex dynamical systems based on recurrences in phase space, which are a fundamental concept in…
We find that scale-free random networks are excellently modeled by a deterministic graph. This graph has a discrete degree distribution (degree is the number of connections of a vertex) which is characterized by a power-law with exponent…
One explanation for the impressive recent boom in network theory might be that it provides a promising tool for an understanding of complex systems. Network theory is mainly focusing on discrete large-scale topological structures rather…
Co-evolution exhibited by a network system, involving the intricate interplay between the dynamics of the network itself and the subsystems connected by it, is a key concept for understanding the self-organized, flexible nature of…
We analyze the patterns of traffic jams in urban networks of five large cities and an urban agglomeration region in China using real data based on a recently developed jam tree model. This model focuses on the way traffic jams spread…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
Recently, a novel model to describe ordering in systems comprising agents which, although matching in their binarity (i.e., maintaining the iconic Ising features of ``+'' or ``-'', ``up'' or ``down'', ``yes'' or ``no''), still differing in…