Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/25089
DC FieldValueLanguage
dc.contributor.authorKocarev, Ljupchoen_US
dc.contributor.authorZlatanov, Nikolaen_US
dc.contributor.authorTrajanov, Dimitaren_US
dc.date.accessioned2022-12-22T09:21:25Z-
dc.date.available2022-12-22T09:21:25Z-
dc.date.issued2010-05-13-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/25089-
dc.description.abstractThe concept of vulnerability is introduced for a model of random, dynamical interactions on networks. In this model, known as influence model, the nodes are arranged in an arbitrary network, while the evolution of the status at a node is according to an internal Markov chain, but with transition probabilities that depend not only on the current status of that node, but also on the statuses of the neighboring nodes. Vulnerability is treated analytically and numerically for several networks with different topological structures, as well as for three real networks: network of infrastructures, power grid, and WWW, identifying the most influential nodes of these networks.en_US
dc.publisherThe Royal Society Publishingen_US
dc.relation.ispartofPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciencesen_US
dc.subjectvulnerability, VulnerabilityRank, Markov chains, networksen_US
dc.titleVulnerability of networks of interacting Markov chainsen_US
dc.typeArticleen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles
Files in This Item:
File Description SizeFormat 
exp-chaos-kocarev-01.pdf638.83 kBAdobe PDFView/Open
Show simple item record

Page view(s)

38
checked on May 25, 2024

Download(s)

6
checked on May 25, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.