Scale-free graphs with edge deletion

MaRDI QIDQ5357616zbMATH OpenFDO

Authors Krzysztof Choromanski, Jacek Miękisz

Publication date 12 September 2017

zbMATH Keywords

edge deletionpower lawspreferential attachmentrandom graphsscale-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Social networks; opinion dynamics (91D30)

Recommendations

• Robustness of Preferential Attachment Under Deletion of Edges
• An edge deletion model for complex networks
• Scale-free graph with preferential attachment and evolving internal vertex structure
• Random Deletion in a Scale-Free Random Graph Process
• Scale-free property for degrees and weights in a preferential attachment random graph model

Cited in

(7)

• Adversarial deletion in a scale free random graph process
• Scale-free graph with preferential attachment and evolving internal vertex structure
• Random Deletion in a Scale-Free Random Graph Process
• Adversarial Deletion in a Scale-Free Random Graph Process
• Robustness of Preferential Attachment Under Deletion of Edges
• An edge deletion model for complex networks
• Degree correlations in growing networks with deletion of nodes

This page was built for publication: Scale-free graphs with edge deletion

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