Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis

DOI10.3934/NHM.2015.10.195MaRDI QIDQ258469zbMATH OpenOpenAlexFDO

Authors Ángel Pérez, Regino Criado, Victor Chapela, Santiago Moral, Miguel Romance

Publication date 10 March 2016

Published in Networks and Heterogeneous Media (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/nhm.2015.10.195

zbMATH Keywords

information diffusionintentional complex networkintentional technological risk

Mathematics Subject Classification ID

Approximation algorithms (68W25) Communication networks in operations research (90B18) Information theory (general) (94A15)

Recommendations

• Vulnerability of complex networks under intentional attack with incomplete information
• Loss of information in feedforward social networks
• Tolerance of local information-based intentional attacks in complex networks
• Brief Announcement
• Social network information dissemination model based on EASD risk criteria

Cites work

• Complex networks: structure and dynamics
• Diffusion in complex social networks
• Dynamical Processes on Complex Networks
• Exploring complex networks
• scientific article; zbMATH DE number 1865707 (Why is no real title available?)
• Maximal Flow Through a Network
• The Structure and Function of Complex Networks

Cited in

(2)

• Enriched line graph: a new structure for searching language collocations
• On the edges’ PageRank and line graphs

This page was built for publication: Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis

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