鲁棒代数连通性

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Programming and Computer Software Pub Date : 2023-12-01 DOI:10.1134/s0361768823060051

I. A. Kuruzov, A. V. Rogozin, S. A. Chezhegov, A. B. Kupavskii

{"title":"鲁棒代数连通性","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":"{\"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}","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

摘要

摘要图的拉普拉斯特征值的第二小特征值称为图的代数连通性。它表示图的连通程度。然而，这个度量并没有考虑到图中可能发生的变化。即使删除一个节点或边也会使其断开连接。这项工作致力于开发一种度量，该度量应该描述图对这种变化的鲁棒性。所有建议的度量都基于代数连通性。此外，我们还推广了一些已知的优化方法，用于代数连通性的鲁棒修正。文中还报道了一些数值实验结果，证明了所提方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Robust Algebraic Connectivity

查看原文本刊更多论文

Robust Algebraic Connectivity

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 工程技术-计算机：软件工程

CiteScore

1.60

自引率

28.60%

发文量

审稿时长

>12 weeks

期刊介绍： 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.