Robustness of random graphs based on graph spectra

DOI10.1063/1.4754875zbMath1319.05117arXiv1009.3430OpenAlexW2091445043WikidataQ85819991 ScholiaQ85819991MaRDI QIDQ2944617

Jun Wu, Hongzhong Deng, Yue-jin Tan, Mauricio Barahona

Publication date: 2 September 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.3430

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items

A new method optimizing the subgraph centrality of large networks ⋮ Tabu search enhances network robustness under targeted attacks ⋮ Scaling of weighted spectral distribution in deterministic scale-free networks ⋮ Reduced synchronizability of dynamical scale-free networks with onion-like topologies ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ Uncertain random spectra: a new metric for assessing the survivability of mobile wireless sensor networks ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characteristic vectors of bordered matrices with infinite dimensions
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• On computing a conditional edge-connectivity of a graph
• Fault diameter of interconnection networks
• Eigenvalues and expanders
• On a class of posets and the corresponding comparability graphs
• Estimating the Estrada index
• Tough graphs and Hamiltonian circuits.
• Isoperimetric numbers of graphs
• Statistical mechanics of complex networks
• Perturbation results for the Estrada index in weighted networks
• Robustness of regular ring lattices based on natural connectivity
• Eigenvalue spectra of complex networks
• Vulnerability of complex networks under intentional attack with incomplete information
• TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS
• Expander graphs and their applications
• Conditional connectivity
• The Structure and Function of Complex Networks
• Congruent Graphs and the Connectivity of Graphs
• Generating Random Regular Graphs Quickly
• The Largest Eigenvalue of Sparse Random Graphs
• Collective dynamics of ‘small-world’ networks
• Spectra of random graphs with given expected degrees
• Explosive Percolation in Random Networks
• Generating random regular graphs

This page was built for publication: Robustness of random graphs based on graph spectra