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

DOI10.1142/S0129183108012510zbMath1203.05156MaRDI QIDQ3542829

Frank Emmert-Streib, Matthias Dehmer

Publication date: 1 December 2008

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

zbMATH Keywords

Markov chainscale-free networksfunctional robustness

Mathematics Subject Classification ID

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

Related Items (3)

Network robustness and random processes ⋮ Detecting intraday financial market states using temporal clustering ⋮ Inequalities for entropy-based measures of network information content

Cites Work

• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Unnamed Item

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