Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
DOI10.1080/00207160701294459zbMATH Open1147.68606OpenAlexW2142032332MaRDI QIDQ5459728FDOQ5459728
Authors: Regino Criado, Benito Hernández-Bermejo, J. Marco-Blanco, Miguel Romance 
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
Recommendations
- Asymptotic estimates for efficiency, vulnerability and cost for random networks
- Efficiency and vulnerability analysis for congested networks with random data
- \((\psi,p,q)\)-vulnerabilities: a unified approach to network robustness
- scientific article
- Structural analysis and optimality of vulnerability and efficiency in artificial networks
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Statistical mechanics of complex networks
- Complex networks: structure and dynamics
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
- Title not available (Why is that?)
- The diameter of sparse random graphs
- Effective measurement of network vulnerability under random and intentional attacks
- Asymptotic estimates for efficiency, vulnerability and cost for random networks
Cited In (4)
- Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them
- Asymptotic estimates for efficiency, vulnerability and cost for random networks
- Title not available (Why is that?)
- Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
This page was built for publication: Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459728)
