Security of scale-free networks

DOI10.1007/S10958-012-0740-4zbMATH Open1254.05087OpenAlexW2045225754MaRDI QIDQ690537FDOQ690537

Authors: M. C. Fu 

Publication date: 28 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-0740-4

Recommendations

• Coupling Scale-Free and Classical Random Graphs
• Principles of Distributed Systems
• Robustness and Vulnerability of Scale-Free Random Graphs
• Vulnerability of robust preferential attachment networks
• On connectivity of conditional configuration graphs under destruction

zbMATH Keywords

LCD model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Network design and communication in computer systems (68M10)

Cites Work

• Evolution of the social network of scientific collaborations
• Collective dynamics of `small-world' networks
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Robustness and Vulnerability of Scale-Free Random Graphs

Cited In (4)

• Individual security, contagion, and network design
• A Theory of Network Security: Principles of Natural Selection and Combinatorics
• On dynamic network security: a random decentering algorithm on graphs
• Coupling Scale-Free and Classical Random Graphs

This page was built for publication: Security of scale-free networks

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