关于凯梅尼常数和随机补数

IF 1 3区 数学 Q1 MATHEMATICS
{"title":"关于凯梅尼常数和随机补数","authors":"","doi":"10.1016/j.laa.2024.09.001","DOIUrl":null,"url":null,"abstract":"<div><p>Given a stochastic matrix <em>P</em> partitioned in four blocks <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub></math></span>, <span><math><mi>i</mi><mo>,</mo><mi>j</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn></math></span>, Kemeny's constant <span><math><mi>κ</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> is expressed in terms of Kemeny's constants of the stochastic complements <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>12</mn></mrow></msub><msup><mrow><mo>(</mo><mi>I</mi><mo>−</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>22</mn></mrow></msub><mo>)</mo></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>P</mi></mrow><mrow><mn>21</mn></mrow></msub></math></span>, and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>22</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>21</mn></mrow></msub><msup><mrow><mo>(</mo><mi>I</mi><mo>−</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>)</mo></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>P</mi></mrow><mrow><mn>12</mn></mrow></msub></math></span>. Specific cases concerning periodic Markov chains and Kronecker products of stochastic matrices are investigated. Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed. Numerical experiments performed on real world problems show the high efficiency and reliability of this algorithm.</p></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0024379524003574/pdfft?md5=c934bca31b23f0a0ae92728ad85a070b&pid=1-s2.0-S0024379524003574-main.pdf","citationCount":"0","resultStr":"{\"title\":\"On Kemeny's constant and stochastic complement\",\"authors\":\"\",\"doi\":\"10.1016/j.laa.2024.09.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Given a stochastic matrix <em>P</em> partitioned in four blocks <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub></math></span>, <span><math><mi>i</mi><mo>,</mo><mi>j</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn></math></span>, Kemeny's constant <span><math><mi>κ</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> is expressed in terms of Kemeny's constants of the stochastic complements <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>12</mn></mrow></msub><msup><mrow><mo>(</mo><mi>I</mi><mo>−</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>22</mn></mrow></msub><mo>)</mo></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>P</mi></mrow><mrow><mn>21</mn></mrow></msub></math></span>, and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>22</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>21</mn></mrow></msub><msup><mrow><mo>(</mo><mi>I</mi><mo>−</mo><msub><mrow><mi>P</mi></mrow><mrow><mn>11</mn></mrow></msub><mo>)</mo></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>P</mi></mrow><mrow><mn>12</mn></mrow></msub></math></span>. Specific cases concerning periodic Markov chains and Kronecker products of stochastic matrices are investigated. Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed. Numerical experiments performed on real world problems show the high efficiency and reliability of this algorithm.</p></div>\",\"PeriodicalId\":18043,\"journal\":{\"name\":\"Linear Algebra and its Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0024379524003574/pdfft?md5=c934bca31b23f0a0ae92728ad85a070b&pid=1-s2.0-S0024379524003574-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linear Algebra and its Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0024379524003574\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linear Algebra and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0024379524003574","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

鉴于随机矩阵 P 分成四个块 Pij(i,j=1,2),可门尼常数 κ(P)用随机补集 P1=P11+P12(I-P22)-1P21 和 P2=P22+P21(I-P11)-1P12 的可门尼常数表示。研究了周期马尔可夫链和随机矩阵的克朗克积的具体情况。给出了扰动矩阵的凯美尼常数的界值。根据这些理论结果,设计了一种高效计算图的凯门尼常数的分而治之算法。在实际问题上进行的数值实验表明了该算法的高效性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Kemeny's constant and stochastic complement

Given a stochastic matrix P partitioned in four blocks Pij, i,j=1,2, Kemeny's constant κ(P) is expressed in terms of Kemeny's constants of the stochastic complements P1=P11+P12(IP22)1P21, and P2=P22+P21(IP11)1P12. Specific cases concerning periodic Markov chains and Kronecker products of stochastic matrices are investigated. Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed. Numerical experiments performed on real world problems show the high efficiency and reliability of this algorithm.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
9.10%
发文量
333
审稿时长
13.8 months
期刊介绍: Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other branches of mathematics and to other sciences. Articles that provide new information or perspectives on the historical development of matrix theory and linear algebra are also welcome. Expository articles which can serve as an introduction to a subject for workers in related areas and which bring one to the frontiers of research are encouraged. Reviews of books are published occasionally as are conference reports that provide an historical record of major meetings on matrix theory and linear algebra.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信