Robustness of preferential-attachment graphs
Abstract The widely used characterization of scale-free networks as “robust-yet-fragile” originates primarily from experiments on instances generated by preferential attachment. According to this characterization, scale-free networks are more robust against random failures but more fragile against t...
Main Authors: | Rouzbeh Hasheminezhad, Ulrik Brandes |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2023-06-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | https://doi.org/10.1007/s41109-023-00556-5 |
Similar Items
-
Investigating the Influence of Inverse Preferential Attachment on Network Development
by: Cynthia S. Q. Siew, et al.
Published: (2020-09-01) -
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
by: Y.A. Malyshkin
Published: (2021-12-01) -
Heterogeneous Preferential Attachment in Key Ethereum-Based Cryptoassets
by: Francesco Maria De Collibus, et al.
Published: (2021-10-01) -
Fitness preferential attachment as a driving mechanism in bitcoin transaction network
by: Aspembitova, Ayana, et al.
Published: (2019) -
Transcriptional Network growing Models using Motif-based Preferential Attachment
by: Ahmed Farouk Abdelzaher, et al.
Published: (2015-10-01)