Related papers: Vulnerability of weighted networks
Assortativity, i.e. the tendency of a vertex to bond with another based on their similarity, such as degree, is an important network characteristic that is well-known to be relevant for the network's robustness against attacks. Commonly it…
Network motifs are often called the building blocks of networks. Analysis of motifs is found to be an indispensable tool for understanding local network structure, in contrast to measures based on node degree distribution and its functions…
Here we report a comprehensive analysis of the robustness of five high-quality real-world complex weighted networks to errors and attacks of nodes and links. We analyze C. Elegans, Cargo ship, E. Coli, Us Airports and Human brain real-world…
In this paper, we study the crucial elements of complex networks, namely nodes, and edges and their properties such as their community structure, which play an important role in dictating the robustness of the network towards structural…
Network structures in a wide array of systems such as social networks, transportation, power and water distribution infrastructures, and biological and ecological systems can exhibit critical thresholds or tipping points beyond which there…
We study the robustness of complex networks subject to edge removal. Several network models and removing strategies are simulated. Rather than the existence of the giant component, we use total connectedness as the criterion of breakdown.…
Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological…
From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers.…
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…
The local structure of unweighted networks can be characterized by the number of times a subgraph appears in the network. The clustering coefficient, reflecting the local configuration of triangles, can be seen as a special case of this…
Inspired by the structure of technological networks, we discuss network evolution mechanisms which give rise to topological properties found in real spatial networks. Thus, the peculiar structure of transport and distribution networks is…
The importance of studying properties of networks is manifest in diverse fields ranging from biology, engineering, physics, chemistry, neuroscience, and medicine. The functionality of networks with regard to performance, throughput,…
The geometric renormalization technique for complex networks has successfully revealed the multiscale self-similarity of real network topologies and can be applied to generate replicas at different length scales. In this letter, we extend…
In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension.…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such…
The measurement and mapping of transportation network vulnerability to natural hazards constitute subjects of global interest, especially due to climate change, and for a sustainable development agenda. During a flood, some elements of a…
The connectivity properties of a weight-bearing network are exploited to enhance it's capacity. We study a 2-d network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the…
Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random…
Most real-world networks are weighted graphs with the weight of the edges reflecting the relative importance of the connections. In this work, we study non degree dependent correlations between edge weights, generalizing thus the…