On the exponential generating function for non-backtracking walks

On the exponential generating function for non-backtracking walks
复制标题

关于非回溯游走的指数生成函数

DOI:
10.1016/j.laa.2018.07.010
复制
发表时间:
2018
影响因子:
1.1
通讯作者:
V. Noferini
V. Noferini
中科院分区:
数学3区
文献类型:
--
作者:
F. Arrigo;P. Grindrod;D. Higham;V. Noferini

文献摘要

参考文献

被引文献

相似文献

我们推导出一个显式公式的指数生成函数与非回溯绕图行走。我们研究无向图和有向图。我们的研究结果使我们能够推导出可计算的表达式的非回溯版本的网络中心性措施的基础上的矩阵指数。我们发现,在这种情况下,消除回溯行走不会显着增加计算费用。我们将展示如何解释新的措施,在一定的多层网络上的标准指数中心计算。从这个块矩阵解释的见解也使我们能够表征一般矩阵函数所产生的中心性措施。对星星图的严格分析说明了非回溯的效果,并表明当我们限制非回溯行走时,可以消除局部化。我们还研究了合成网络上的本地化问题。
We derive an explicit formula for the exponential generating function associated with non-backtracking walks around a graph. We study both undirected and directed graphs. Our results allow us to derive computable expressions for non-backtracking versions of network centrality measures based on the matrix exponential. We find that eliminating backtracking walks in this context does not significantly increase the computational expense. We show how the new measures may be interpreted in terms of standard exponential centrality computation on a certain multilayer network. Insights from this block matrix interpretation also allow us to characterize centrality measures arising from general matrix functions. Rigorous analysis on the star graph illustrates the effect of non-backtracking and shows that localization can be eliminated when we restrict to non-backtracking walks. We also investigate the localization issue on synthetic networks.
拓扑揭示了网络比较的通用特征
DOI: 10.48550/arxiv.1705.05677
发表时间: 2017
期刊: arXiv e-prints
影响因子: --
作者:
Maugis
通讯作者: Maugis
DOI: 10.1137/100788860
发表时间: 2011-01-01
影响因子: 3.1
作者:
Al-Mohy, Awad H.;Higham, Nicholas J.
通讯作者: Higham, Nicholas J.
DOI: 10.1137/17m1132537
发表时间: 2018
影响因子: 3.1
作者:
Rostami, Minghao W.;Xue, Fei
通讯作者: Xue, Fei