Asymptotic estimates for efficiency, vulnerability and cost for random networks
From MaRDI portal
Publication:879426
DOI10.1016/j.cam.2006.04.035zbMath1135.68313MaRDI QIDQ879426
Miguel Romance, J. Marco-Blanco, Benito Hernández-Bermejo, Regino Criado
Publication date: 11 May 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.04.035
Related Items
Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model, Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
Cites Work
- Effective measurement of network vulnerability under random and intentional attacks
- Harmony in the small-world
- Efficiency of scale-free networks: Error and attack tolerance
- How the science of complex networks can help developing strategies against terrorism
- New results on computable efficiency and its stability for complex networks
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks