SIAM Journal on Algebraic and Discrete Methods
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Strategic warfare in cyberspace
Strategic warfare in cyberspace
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
Inequalities for Means of Restricted First-Passage Times in Percolation Theory
Combinatorics, Probability and Computing
When a genetic algorithm outperforms hill-climbing
Theoretical Computer Science
A graph-theoretical model of computer security: From file sharing to social engineering
International Journal of Information Security
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Ad-hoc Networks: Fundamental Properties and Network Topologies
Ad-hoc Networks: Fundamental Properties and Network Topologies
IEEE Transactions on Computers
New approaches to reliability and survivability with survival analysis, dynamic hybrid fault models, and evolutionary game theory
Scalability of network-failure resilience: analysis using multi-layer probabilistic graphical models
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Resilient multi-core systems: a hierarchical formal model for N-variant executions
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
Introduction of first passage time (FPT) analysis for software reliability and network security
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Advances in artificial immune systems
IEEE Computational Intelligence Magazine
Bounds for probability of success of classical genetic algorithm based on hamming distance
IEEE Transactions on Evolutionary Computation
The impact of countermeasure propagation on the prevalence of computer viruses
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A note on the spread of worms in scale-free networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Analysis and synthesis problems for network resilience
Mathematical and Computer Modelling: An International Journal
The capacity of wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We argue for the applications of first passage time FPT and first passage percolation FPP problems to the modelling and analysis of network resilience as well as effective strategies in strategic information warfare SIW. Several intuitive arguments can be readily made to justify our attempt. First, winning a confrontation can be abstracted as an FPT or FPP problem. Secondly, information warfare is very similar to the directed percolation. Thirdly, three essential metrics in the FPP theory, percolation critical probability Pc, first passage percolation time, and shape set Bt can be mapped to the probability to win or lose the war, network resilience, and effective strike range, respectively. Fourthly, non-linearity is prevalent in SIW; percolation theory, and complexity science in large, are particularly effective in tackling this critical issue. To the best of our knowledge, this should be the first review on applying FPT and FPP theories to the SIW research.