A Theory of Network Security: Principles of Natural Selection and Combinatorics

DOI10.1080/15427951.2015.1098755zbMath1461.68019OpenAlexW2342202467MaRDI QIDQ5856435

Yicheng Pan, Ang Sheng Li

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2015.1098755

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameters in preferential attachment models
• A note on an inequality involving the normal distribution
• The diameter of a scale-free random graph
• On certain connectivity properties of the internet topology
• Strategies for network security
• The small-community phenomenon in networks
• Community Structures in Classical Network Models
• Emergence of Scaling in Random Networks
• Scale-Free Networks: A Decade and Beyond
• Economic Networks: The New Challenges
• The small-world phenomenon
• Note on the heights of random recursive trees and random m‐ary search trees
• The Structure and Function of Complex Networks
• A simple model of global cascades on random networks
• Contagion
• A Random-Surfer Web-Graph Model
• Collective dynamics of ‘small-world’ networks
• Which Networks are Least Susceptible to Cascading Failures?

This page was built for publication: A Theory of Network Security: Principles of Natural Selection and Combinatorics