On dynamic network security: A random decentering algorithm on graphs

On dynamic network security: A random decentering algorithm on graphs

Random Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation, centrality reduction and randomness. First simula...

Full description

Bibliographic Details
Main Authors: Trobajo M.T., Cifuentes-Rodríguez J., Carriegos M.V.
Format: Article
Language:English
Published: De Gruyter 2018-06-01
Series:Open Mathematics
Subjects:
network analysis
cybersecurity
scale-free graph
centrality
algorithms
68r10
94c15
Online Access:https://doi.org/10.1515/math-2018-0059

Internet

https://doi.org/10.1515/math-2018-0059

Similar Items