边电晕积图上随机游动的击中时
Hitting Times of Random Walks on Edge Corona Product Graphs
摘要:
图积已被广泛应用于复杂网络的建模,在现实世界的复杂系统中观察到显着的性质。本文研究了一类由边冠积迭代生成的图上随机游动的击中时。我们首先推导出与图相关的归一化邻接矩阵的特征值和特征向量的递归解。基于这些结果,我们进一步得到有趣的数量的随机游动的命中时间,提供迭代公式的两个节点的命中时间,以及封闭形式的表达式定义为加权平均的命中时间在所有节点对的Kemeny常数,以及算术平均值的命中时间的所有节点对。
英文摘要:
Graph products have been extensively applied to model complex networks with striking properties observed in real-world complex systems. In this paper, we study the hitting times for random walks on a class of graphs generated iteratively by edge corona product. We first derive recursive solutions to the eigenvalues and eigenvectors of the normalized adjacency matrix associated with the graphs. Based on these results, we further obtain interesting quantities about hitting times of random walks, providing iterative formulas for two-node hitting time, as well as closed-form expressions for the Kemeny's constant defined as a weighted average of hitting times over all node pairs, as well as the arithmetic mean of hitting times of all pairs of nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。