Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs

IF 1.5 2区 数学 Q2 MATHEMATICS, APPLIED
Francesca Arrigo, Desmond J. Higham, Vanni Noferini, Ryan Wood
{"title":"Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs","authors":"Francesca Arrigo, Desmond J. Higham, Vanni Noferini, Ryan Wood","doi":"10.1137/23m155219x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Matrix Analysis and Applications, Volume 45, Issue 1, Page 397-418, March 2024. <br/> Abstract. We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two ways to compute the associated generating function, and corresponding node centrality measures. One method works directly on the original graph and one uses a line graph construction followed by a projection. The first method is more efficient, but the second has the advantage of extending naturally to time-evolving graphs. Based on these generating functions, we define and study corresponding centrality measures. Illustrative computational results are also provided.","PeriodicalId":49538,"journal":{"name":"SIAM Journal on Matrix Analysis and Applications","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Matrix Analysis and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m155219x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Matrix Analysis and Applications, Volume 45, Issue 1, Page 397-418, March 2024.
Abstract. We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two ways to compute the associated generating function, and corresponding node centrality measures. One method works directly on the original graph and one uses a line graph construction followed by a projection. The first method is more efficient, but the second has the advantage of extending naturally to time-evolving graphs. Based on these generating functions, we define and study corresponding centrality measures. Illustrative computational results are also provided.
加权图上非回溯行走的加权枚举
SIAM 矩阵分析与应用期刊》,第 45 卷,第 1 期,第 397-418 页,2024 年 3 月。 摘要我们将无权重图中的非回溯走行概念扩展到边具有非负权重的图。在这里,与走行相关的权重是各条边权重的乘积。我们给出了两种计算相关生成函数和相应节点中心度量的方法。一种方法是直接计算原始图,另一种方法是先构建线图,然后进行投影。第一种方法更有效,但第二种方法的优点是可以自然扩展到时间演化图。基于这些生成函数,我们定义并研究了相应的中心性度量。我们还提供了示例性计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.90
自引率
6.70%
发文量
61
审稿时长
6-12 weeks
期刊介绍: The SIAM Journal on Matrix Analysis and Applications contains research articles in matrix analysis and its applications and papers of interest to the numerical linear algebra community. Applications include such areas as signal processing, systems and control theory, statistics, Markov chains, and mathematical biology. Also contains papers that are of a theoretical nature but have a possible impact on applications.
×
引用
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学术官方微信