Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
DOI10.1016/j.physleta.2008.12.067zbMath1228.82019OpenAlexW2034676697MaRDI QIDQ653449
J. Marco-Blanco, Miguel Romance, Benito Hernández-Bermejo
Publication date: 19 December 2011
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2008.12.067
Trees (05C05) Enumeration in graph theory (05C30) Combinatorial inequalities (05A20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- Effective measurement of network vulnerability under random and intentional attacks
- Asymptotic estimates for efficiency, vulnerability and cost for random networks
- Efficiency of scale-free networks: Error and attack tolerance
- How the science of complex networks can help developing strategies against terrorism
- The diameter of a scale-free random graph
- Complex networks: structure and dynamics
- New results on computable efficiency and its stability for complex networks
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS
- The Structure and Function of Complex Networks
- Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
- CENTRALITY ESTIMATION IN LARGE NETWORKS
This page was built for publication: Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
