Asymptotic estimates for efficiency, vulnerability and cost for random networks
From MaRDI portal
Publication:879426
DOI10.1016/J.CAM.2006.04.035zbMATH Open1135.68313OpenAlexW1969320648MaRDI QIDQ879426FDOQ879426
Authors: Regino Criado, Benito Hernández-Bermejo, J. Marco-Blanco, Miguel Romance 
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
Recommendations
- Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
- \((\psi,p,q)\)-vulnerabilities: a unified approach to network robustness
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Vulnerability of networks of interacting Markov chains
- Structural analysis and optimality of vulnerability and efficiency in artificial networks
Cites Work
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- Efficiency of scale-free networks: Error and attack tolerance
- How the science of complex networks can help developing strategies against terrorism
- Harmony in the small-world
- New results on computable efficiency and its stability for complex networks
- Effective measurement of network vulnerability under random and intentional attacks
Cited In (5)
- Structural analysis and optimality of vulnerability and efficiency in artificial networks
- Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
- Union of random minkowski sums and network vulnerability analysis
- Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
- \((\psi,p,q)\)-vulnerabilities: a unified approach to network robustness
This page was built for publication: Asymptotic estimates for efficiency, vulnerability and cost for random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879426)
