ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS

DOI10.1142/S0129183108012510zbMATH Open1203.05156MaRDI QIDQ3542829FDOQ3542829

Frank Emmert-Streib, Matthias Dehmer

Publication date: 1 December 2008

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Recommendations

• OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
• Principles of Distributed Systems
• Robustness and Vulnerability of Scale-Free Random Graphs
• Robustness of scale-free networks with dynamical behavior against multi-node perturbation
• Study on indices of network structure robustness and their application

zbMATH Keywords

Markov chainscale-free networksfunctional robustness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Neural networks for/in biological studies, artificial life and related topics (92B20) Random walks on graphs (05C81) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Title not available (Why is that?)

Cited In (4)

• Network robustness and random processes
• Inequalities for entropy-based measures of network information content
• Detecting intraday financial market states using temporal clustering
• Robustness and Vulnerability of Scale-Free Random Graphs

This page was built for publication: ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3542829)