I. A. Kuruzov, A. V. Rogozin, S. A. Chezhegov, A. B. Kupavskii
{"title":"Robust Algebraic Connectivity","authors":"I. A. Kuruzov, A. V. Rogozin, S. A. Chezhegov, A. B. Kupavskii","doi":"10.1134/s0361768823060051","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The second smallest eigenvalue of the Laplacian is known as the algebraic connectivity of a graph. It shows degree of graph connectivity. However, this metric does not take into account possible changes in the graph. The removal of even one node or edge can make it disconnected. This work is devoted to the development of a metric that should describe robustness of a graph to such changes. All proposed metrics are based on the algebraic connectivity. In addition, we generalize some well-known optimization methods for our robust modifications of the algebraic connectivity. The paper also reports results of some numerical experiments demonstrating the efficiency of the proposed approaches.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"13 5","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming and Computer Software","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0361768823060051","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
The second smallest eigenvalue of the Laplacian is known as the algebraic connectivity of a graph. It shows degree of graph connectivity. However, this metric does not take into account possible changes in the graph. The removal of even one node or edge can make it disconnected. This work is devoted to the development of a metric that should describe robustness of a graph to such changes. All proposed metrics are based on the algebraic connectivity. In addition, we generalize some well-known optimization methods for our robust modifications of the algebraic connectivity. The paper also reports results of some numerical experiments demonstrating the efficiency of the proposed approaches.
期刊介绍：
Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
