Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees (Q653449): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.physleta.2008.12.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034676697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex networks: structure and dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective measurement of network vulnerability under random and intentional attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on computable efficiency and its stability for complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of scale-free networks: Error and attack tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model / rank
 
Normal rank
Property / cites work
 
Property / cites work: How the science of complex networks can help developing strategies against terrorism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic estimates for efficiency, vulnerability and cost for random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a scale-free random graph / rank
 
Normal rank

Latest revision as of 19:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
scientific article

    Statements

    Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees (English)
    0 references
    0 references
    0 references
    19 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Barabási-Albert networks
    0 references
    mean-field theory
    0 references
    network efficiency
    0 references
    0 references