Finding minimum node separators: A Markov chain Monte Carlo method
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Joohyun | - |
dc.contributor.author | Kwak, Jaewook | - |
dc.contributor.author | Lee, Hyang-Won | - |
dc.contributor.author | Shroff, Ness B. | - |
dc.date.accessioned | 2021-06-22T11:23:10Z | - |
dc.date.available | 2021-06-22T11:23:10Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2018-10 | - |
dc.identifier.issn | 0951-8320 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/5278 | - |
dc.description.abstract | In networked systems such as communication networks or power grids, graph separation from node failures can damage the overall operation severely. One of the most important goals of network attackers is thus to separate nodes so that the sizes of connected components become small. In this work, we consider the problem of finding a minimum a-separator, that partitions the graph into connected components of sizes at most an, where n is the number of nodes. To solve the alpha-separator problem, we develop a random walk algorithm based on Metropolis chain. We characterize the conditions for the first passage time (to find an optimal solution) of our algorithm. We also find an optimal cooling schedule, under which the random walk converges to an optimal solution almost surely. Furthermore, we generalize our algorithm to non-uniform node weights. We show through extensive simulations that the first passage time is less than O(n(3)), thereby validating our analysis. The solution found by our algorithm allows us to identify the weakest points in the network that need to be strengthened. Simulations in real topologies show that attacking a dense area is often not an efficient solution for partitioning a network into small components. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCI LTD | - |
dc.title | Finding minimum node separators: A Markov chain Monte Carlo method | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Joohyun | - |
dc.identifier.doi | 10.1016/j.ress.2018.06.005 | - |
dc.identifier.scopusid | 2-s2.0-85049329553 | - |
dc.identifier.wosid | 000441493700017 | - |
dc.identifier.bibliographicCitation | RELIABILITY ENGINEERING & SYSTEM SAFETY, v.178, pp.225 - 235 | - |
dc.relation.isPartOf | RELIABILITY ENGINEERING & SYSTEM SAFETY | - |
dc.citation.title | RELIABILITY ENGINEERING & SYSTEM SAFETY | - |
dc.citation.volume | 178 | - |
dc.citation.startPage | 225 | - |
dc.citation.endPage | 235 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | RELIABILITY | - |
dc.subject.keywordPlus | INFRASTRUCTURES | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordAuthor | Graph separation problem | - |
dc.subject.keywordAuthor | Node attack | - |
dc.subject.keywordAuthor | Markov chain Monte Carlo | - |
dc.subject.keywordAuthor | Metropolis algorithm | - |
dc.subject.keywordAuthor | Hierarchical Markov chain | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0951832017307263?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.