16,747 research outputs found
On the influence of topological characteristics on robustness of complex networks
In this paper, we explore the relationship between the topological
characteristics of a complex network and its robustness to sustained targeted
attacks. Using synthesised scale-free, small-world and random networks, we look
at a number of network measures, including assortativity, modularity, average
path length, clustering coefficient, rich club profiles and scale-free exponent
(where applicable) of a network, and how each of these influence the robustness
of a network under targeted attacks. We use an established robustness
coefficient to measure topological robustness, and consider sustained targeted
attacks by order of node degree. With respect to scale-free networks, we show
that assortativity, modularity and average path length have a positive
correlation with network robustness, whereas clustering coefficient has a
negative correlation. We did not find any correlation between scale-free
exponent and robustness, or rich-club profiles and robustness. The robustness
of small-world networks on the other hand, show substantial positive
correlations with assortativity, modularity, clustering coefficient and average
path length. In comparison, the robustness of Erdos-Renyi random networks did
not have any significant correlation with any of the network properties
considered. A significant observation is that high clustering decreases
topological robustness in scale-free networks, yet it increases topological
robustness in small-world networks. Our results highlight the importance of
topological characteristics in influencing network robustness, and illustrate
design strategies network designers can use to increase the robustness of
scale-free and small-world networks under sustained targeted attacks
The failure tolerance of mechatronic software systems to random and targeted attacks
This paper describes a complex networks approach to study the failure
tolerance of mechatronic software systems under various types of hardware
and/or software failures. We produce synthetic system architectures based on
evidence of modular and hierarchical modular product architectures and known
motifs for the interconnection of physical components to software. The system
architectures are then subject to various forms of attack. The attacks simulate
failure of critical hardware or software. Four types of attack are
investigated: degree centrality, betweenness centrality, closeness centrality
and random attack. Failure tolerance of the system is measured by a 'robustness
coefficient', a topological 'size' metric of the connectedness of the attacked
network. We find that the betweenness centrality attack results in the most
significant reduction in the robustness coefficient, confirming betweenness
centrality, rather than the number of connections (i.e. degree), as the most
conservative metric of component importance. A counter-intuitive finding is
that "designed" system architectures, including a bus, ring, and star
architecture, are not significantly more failure-tolerant than interconnections
with no prescribed architecture, that is, a random architecture. Our research
provides a data-driven approach to engineer the architecture of mechatronic
software systems for failure tolerance.Comment: Proceedings of the 2013 ASME International Design Engineering
Technical Conferences & Computers and Information in Engineering Conference
IDETC/CIE 2013 August 4-7, 2013, Portland, Oregon, USA (In Print
ELASTICITY: Topological Characterization of Robustness in Complex Networks
Just as a herd of animals relies on its robust social structure to survive in
the wild, similarly robustness is a crucial characteristic for the survival of
a complex network under attack. The capacity to measure robustness in complex
networks defines the resolve of a network to maintain functionality in the
advent of classical component failures and at the onset of cryptic malicious
attacks. To date, robustness metrics are deficient and unfortunately the
following dilemmas exist: accurate models necessitate complex analysis while
conversely, simple models lack applicability to our definition of robustness.
In this paper, we define robustness and present a novel metric, elasticity- a
bridge between accuracy and complexity-a link in the chain of network
robustness. Additionally, we explore the performance of elasticity on Internet
topologies and online social networks, and articulate results
Structural Vulnerability Analysis of Electric Power Distribution Grids
Power grid outages cause huge economical and societal costs. Disruptions in
the power distribution grid are responsible for a significant fraction of
electric power unavailability to customers. The impact of extreme weather
conditions, continuously increasing demand, and the over-ageing of assets in
the grid, deteriorates the safety of electric power delivery in the near
future. It is this dependence on electric power that necessitates further
research in the power distribution grid security assessment. Thus measures to
analyze the robustness characteristics and to identify vulnerabilities as they
exist in the grid are of utmost importance. This research investigates exactly
those concepts- the vulnerability and robustness of power distribution grids
from a topological point of view, and proposes a metric to quantify them with
respect to assets in a distribution grid. Real-world data is used to
demonstrate the applicability of the proposed metric as a tool to assess the
criticality of assets in a distribution grid
Effectiveness of dismantling strategies on moderated vs. unmoderated online social platforms
Online social networks are the perfect test bed to better understand
large-scale human behavior in interacting contexts. Although they are broadly
used and studied, little is known about how their terms of service and posting
rules affect the way users interact and information spreads. Acknowledging the
relation between network connectivity and functionality, we compare the
robustness of two different online social platforms, Twitter and Gab, with
respect to dismantling strategies based on the recursive censor of users
characterized by social prominence (degree) or intensity of inflammatory
content (sentiment). We find that the moderated (Twitter) vs unmoderated (Gab)
character of the network is not a discriminating factor for intervention
effectiveness. We find, however, that more complex strategies based upon the
combination of topological and content features may be effective for network
dismantling. Our results provide useful indications to design better strategies
for countervailing the production and dissemination of anti-social content in
online social platforms
The web of federal crimes in Brazil: topology, weaknesses, and control
Law enforcement and intelligence agencies worldwide struggle to find
effective ways to fight and control organized crime. However, illegal networks
operate outside the law and much of the data collected is classified.
Therefore, little is known about criminal networks structure, topological
weaknesses, and control. In this contribution we present a unique criminal
network of federal crimes in Brazil. We study its structure, its response to
different attack strategies, and its controllability. Surprisingly, the network
composed of multiple crimes of federal jurisdiction has a giant component,
enclosing more than a half of all its edges. This component shows some typical
social network characteristics, such as small-worldness and high clustering
coefficient, however it is much "darker" than common social networks, having
low levels of edge density and network efficiency. On the other side, it has a
very high modularity value, . Comparing multiple attack strategies, we
show that it is possible to disrupt the giant component of the network by
removing only of its edges or nodes, according to a module-based
prescription, precisely due to its high modularity. Finally, we show that the
component is controllable, in the sense of the exact network control theory, by
getting access to of the driver nodes.Comment: 9 pages, 5 figure
- …