Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees

DOI10.1016/J.PHYSLETA.2008.12.067MaRDI QIDQ653449zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

Barabási-Albert networksmean-field theorynetwork efficiency

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Trees (05C05) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Recommendations

• A generalization of the Barabási-Albert random tree
• On a tail bound for analyzing random trees
• A probabilistic analysis of some tree algorithms
• scientific article; zbMATH DE number 2038884
• A surprising property of the Barabási--Albert random tree
• scientific article; zbMATH DE number 58317
• Improved bounds for the expected behaviour of AVL trees
• An analytic approach to the height of binary search trees
• Scale free properties of random \(k\)-trees
• scientific article; zbMATH DE number 7234299

Cites work

• Asymptotic estimates for efficiency, vulnerability and cost for random networks
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Complex networks: structure and dynamics
• Effective measurement of network vulnerability under random and intentional attacks
• Efficiency of scale-free networks: Error and attack tolerance
• Emergence of Scaling in Random Networks
• How the science of complex networks can help developing strategies against terrorism
• New results on computable efficiency and its stability for complex networks
• Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
• Statistical mechanics of complex networks
• The diameter of a scale-free random graph
• The Structure and Function of Complex Networks
• TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS

This page was built for publication: Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653449)