Random Walks on Dynamic Graphs
Random Walks on Dynamic Graphs
复制标题
动态图上的随机游走
DOI：
10.11540/bjsiam.32.1_5
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
白髪 丈晴
中科院分区：
文献类型：
--
作者：
来嶋 秀治;清水 伸高;白髪 丈晴
真实的网络经常是动态的。然而，与静态网络上丰富的知识相比，动态网络上分析算法和随机过程的知识是有限的。因此，动态网络的理论分析已成为网络科学与工程领域的研究热点。本文回顾了动态网络分析中的随机游动，重点是覆盖时间。我们还介绍了“收集优惠券的类型越来越多，”从我们最近的工作随机游走的动态图分析与越来越多的顶点。
Real networks are frequently dynamic. Nevertheless, knowledge about analyzing algorithms and stochastic processes on dynamic networks is limited, compared to the wealth of knowledge on static networks. Therefore, dynamic network theoretical analyses have attracted much attention in network science and engineering. This article reviews random walks on dynamic network analysis, focusing on cover time. We also introduce the “collecting coupons with an increasing number of types,” from our recent work on random walks on dynamic graph analysis with an increasing number of vertices.