Related papers: Braess like Paradox on Ladder Network
As a clear signature of modern urban design concepts, urban street networks in dense populated zones are evolving nowadays towards grid-like layouts with rectangular shapes, and most studies on traffic flow assume street networks as square…
Ever since the Barab\'{a}si-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured…
Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…
Triangles are an important building block and distinguishing feature of real-world networks, but their structure is still poorly understood. Despite numerous reports on the abundance of triangles, there is very little information on what…
The critical infrastructures of the nation such as the power grid and the communication network are highly interdependent. Also, it has been observed that there exists complex interdependent relationships between individual entities of the…
The dynamics of cascading failures in spatial interdependent networks significantly depend on the interaction range of dependency couplings between layers. In particular, for increasing range of dependency couplings, different types of…
We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics…
Electric power-systems are one of the most important critical infrastructures. In recent years, they have been exposed to extreme stress due to the increasing demand, the introduction of distributed renewable energy sources, and the…
Conventionally, pairwise relationships between nodes are considered to be the fundamental building blocks of complex networks. However, over the last decade the overabundance of certain sub-network patterns, so called motifs, has attracted…
In this paper we fully describe the trajectory of gradient flow over diagonal linear networks in the limit of vanishing initialisation. We show that the limiting flow successively jumps from a saddle of the training loss to another until…
The network structure of an urban transportation system has a significant impact on its traffic performance. This study uses network indicators along with several traffic performance measures including speed, trip length, travel time, and…
One abstract method for the study of network transportation is proposed in this paper. By interpolating the properties of the edges that constitute network into the two leading parameters of the nodes, this method can abstract the…
The dynamics of power-grid networks is becoming an increasingly active area of research within the physics and network science communities. The results from such studies are typically insightful and illustrative, but are often based on…
This work reports a quantitative analysis to predicting the efficiency of distributed computing running in three models of complex networks: Barab\'asi-Albert, Erd\H{o}s-R\'enyi and Watts-Strogatz. A master/slave computing model is…
We consider a discrete-time nonatomic routing game with variable demand and uncertain costs. Given a routing network with single origin and destination, the cost function of each edge depends on some uncertain persistent state parameter. At…
Cascade models on networks have been used extensively to study cascade failure in complex systems. However, most current models consider failure caused by node damage and neglect the possibility of link damage, which is relevant to…
A new complex network model is proposed which is founded on growth with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert…
Spatial networks, in which nodes and edges are embedded in space, play a vital role in the study of complex systems. For example, many social networks attach geo-location information to each user, allowing the study of not only topological…
We consider a nonatomic selfish routing model with independent stochastic travel times, represented by mean and variance latency functions for each edge that depend on their flows. In an effort to decouple the effect of risk-averse player…
Inspired by studies on airline networks we propose a general model for weighted networks in which topological growth and weight dynamics are both determined by cost adversarial mechanism. Since transportation networks are designed and…