Related papers: Scaling Laws in Chennai Bus Network

In this paper, we present a simple model of scale-free networks that incorporates both preferential & random attachment and anti-preferential & random deletion at each time step. We derive the degree distribution analytically and show that…

In this paper, we derive a topological pattern of urban street networks using a large sample (the largest so far to the best of our knowledge) of 40 U.S. cities and a few more from elsewhere of different sizes. It is found that all the…

We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution…

We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative…

An urban road network of Le Mans in France is analyzed. Some topological properties of network are investigated, such as degree distribution, clustering coefficient, diameter, and characteristic path length. These results suggest that our…

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…

Subway systems span most large cities, and railway networks most countries in the world. These networks are fundamental in the development of countries and their cities, and it is therefore crucial to understand their formation and…

Dynamic ride-sharing services, including ride-pooling offered by ride-hailing platforms and demand-responsive buses, have become an essential part of urban mobility systems. These services cater to personalized and on-demand mobility…

Sharing rides could drastically improve the efficiency of car and taxi transportation. Unleashing such potential, however, requires understanding how urban parameters affect the fraction of individual trips that can be shared, a quantity…

Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…

We show that there are two classes of finite size effects for dynamic models taking place on a scale-free topology. Some models in finite networks show a behavior that depends only on the system size N. Others present an additional distinct…

How does the shape of a network change as its size increases? Although random graph models provide some expectations for such "scaling behaviors" in the structure of networks, relatively little is known about how empirical network structure…

Indian Railway Network has been analyzed on the basis of number of trains directly linking two railway zones. The network has been displayed as a weighted graph where the weights denote the number of trains between the zones. It may be…

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…

We study the topological and geographic structure of the national road networks of the United States, England and Denmark. By transforming these networks into their dual representation, where roads are vertices and an edge connects two…

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…

Discoveries of the scale-free and small-world features are reported on a network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the…

We study the traffic-driven epidemic spreading on scale-free networks with tunable degree distribution. The heterogeneity of networks is controlled by the exponent $\gamma$ of power-law degree distribution. It is found that the epidemic…

Public transport systems in 22 Polish cities have been analyzed. Sizes of these networks range from N=152 to N=2881. Depending on the assumed definition of network topology the degree distribution can follow a power law or can be described…

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…