Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model

DOI10.1080/00207160701294459zbMath1147.68606MaRDI QIDQ5459728

J. Marco-Blanco, Miguel Romance, Regino Criado, Benito Hernández-Bermejo

Publication date: 29 April 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701294459

zbMATH Keywords

computational mathematics; complex systems; mathematical modelling; formal languages; complex networks

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

94C15: Applications of graph theory to circuits and networks

Related Items

Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them

Cites Work

• Unnamed Item
• Effective measurement of network vulnerability under random and intentional attacks
• Asymptotic estimates for efficiency, vulnerability and cost for random networks
• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• The diameter of sparse random graphs