Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them

DOI10.1007/978-1-4614-0857-4_1zbMath1247.90073OpenAlexW76861262MaRDI QIDQ2917207

Miguel Romance, Regino Criado

Publication date: 28 September 2012

Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0857-4_1

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items

Reducing the vulnerability of network by inserting modular topologies

Cites Work

• Analytical relationships between metric and centrality measures of a network and its dual
• Laplace eigenvalues of graphs---a survey
• Vulnerability of complex networks
• Effective measurement of network vulnerability under random and intentional attacks
• Spectral bounds for the betweenness of a graph
• Choosing a leader on a complex network
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• Eigenvalues, diameter, and mean distance in graphs
• The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
• Recent results in the theory of graph spectra
• Laplacian matrices of graphs: A survey
• Efficiency of scale-free networks: Error and attack tolerance
• Protocols for authentification and key establishment
• How the science of complex networks can help developing strategies against terrorism
• Complex networks: structure and dynamics
• New results on computable efficiency and its stability for complex networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A NODE-BASED MULTISCALE VULNERABILITY OF COMPLEX NETWORKS
• VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
• Functional centrality in graphs
• Vulnerability of complex networks under intentional attack with incomplete information
• Synchronizability of complex networks
• Improvements in performance and security for complex networks
• Multiscale vulnerability of complex networks
• Algebraic Graph Theory
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• A survey of graph laplacians
• ( ψ , p , q ) -vulnerabilities: A unified approach to network robustness
• Performance Analysis of Communications Networks and Systems
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
• Spectra of random graphs with given expected degrees
• Network Analysis
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item