Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, 01 November 2011, Vol.390(23-24), pp.4610-4620
    Description: A new family of networks, called , has recently been proposed in the literature. These networks have optimal properties in terms of synchronization, robustness against errors and attacks, and efficient communication. They are built with an algorithm which uses modified simulated annealing to enhance a well-known measure of networks’ ability to reach synchronization among nodes. In this work, we suggest that a class of networks similar to entangled networks can be produced by changing some of the connections in a given network, or by just adding a few connections. We call this class of networks . Although entangled networks can be considered as a subset of weak-entangled networks, we show that both classes share similar properties, especially with respect to synchronization and robustness, and that they have similar structural properties. ► We present rewiring procedure that produces networks with weak-entangled structure. ► We examine the structural properties, synchronization and robustness of the networks. ► We show that they share similar properties as entangled networks. ► Our procedure improves the synchronizability and robustness of a given network. ► The procedure exploits only the homogenization of the nodes’ degree.
    Keywords: Complex Networks ; Entangled Networks ; Synchronization ; Vulnerability ; Physics
    ISSN: 0378-4371
    E-ISSN: 1873-2119
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, 2011, Vol.16(1), pp.341-349
    Description: We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős–Rényi (ER) random networks, Barabási–Albert (BA) model of scale-free networks, Watts–Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.
    Keywords: Complex Networks ; Vulnerability ; Graph Theory ; Centrality Measures ; Network Topologies ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: Physica A: Statistical Mechanics and its Applications, 2010, Vol.389(23), pp.5538-5549
    Description: We propose a metric for vulnerability of labeled graphs that has the following two properties: (1) when the labeled graph is considered as an unlabeled one, the metric reduces to the corresponding metric for an unlabeled graph; and (2) the metric has the same value for differently labeled fully connected graphs, reflecting the notion that any arbitrarily labeled fully connected topology is equally vulnerable as any other. A vulnerability analysis of two real-world networks, the power grid of the European Union, and an autonomous system network, has been performed. The networks have been treated as graphs with node labels. The analysis consists of calculating characteristic path lengths between labels of nodes and determining largest connected cluster size under two node and edge attack strategies. Results obtained are more informative of the networks’ vulnerability compared to the case when the networks are modeled with unlabeled graphs.
    Keywords: Labeled Networks ; Vulnerability ; Eu Power Grid ; As Network ; Physics
    ISSN: 0378-4371
    E-ISSN: 1873-2119
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: Communications in Nonlinear Science and Numerical Simulation, April 2010, Vol.15(4), pp.1008-1018
    Description: In this paper we propose an alternative way to study robustness and vulnerability of complex networks, applying a modal analysis. The modal weights of the network nodes are considered as a measure for their busyness, which is further used for preferential removal of nodes and attack simulation. Analyses of the attack vulnerability are carried out for several generic graphs, generated according to ER and BA algorithms, as well as for some examples of manmade networks. It was found that a modal weight based attack causes significant disintegration of manmade networks by removing a small fraction of the busiest nodes, comparable to the one based on the node degree and betweenness centrality.
    Keywords: Vulnerability ; Modal Analysis ; Modal Weight ; Generic Networks ; Manmade Networks ; Applied Sciences
    ISSN: 1007-5704
    E-ISSN: 1878-7274
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: Novel Algorithms and Techniques in Telecommunications and Networking, pp.211-216
    Description: Complex networks have been an up-and-coming exciting field in the realm of interactions. With their widespread use appearing on the horizon it is ever more vital to be able to measure their vulnerability as a function of their topology. Precisely, discovering vulnerable links, disposed to attacks, can help in hardening these links and by that providing more secure and reliable network structure. This paper addresses the link vulnerability of different topologies of complex networks such as: random networks, geographic random networks, small world networks and scale-free networks. We introduce measure for vulnerability of complex networks, and prove by simulations that network vulnerability heavily depends on the network topology.
    Keywords: Engineering ; Communications Engineering, Networks ; Computer Communication Networks ; Complex Networks ; Vulnerability ; Game Theory ; Network Topology ; Engineering
    ISBN: 9789048136612
    ISBN: 904813661X
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages