Double图的撞击时间的期望值  

Expected Hitting Time of Double Graphs

作　　者：孙春雨 

机构地区：[1]华南理工大学数学学院,广东 广州

出　　处：《理论数学》2021年第4期472-476,共5页Pure Mathematics

摘　　要：令G为简单连通图,DG为其double图,称图G的随机游走从点u首次到达点v所需步数的期望值为点u到点v的撞击时间的期望值。本文给出了DG和G中任意两点撞击时间的期望值之间的关系。Let G be a simple connected graph and let DG be its double graph. The expected hitting time from vertices u to v is the expected value of the minimum number of jumps the random walk needs from u to v. In this paper, a relation for the expected hitting time between any two vertices of DG and G is displayed.

关 键 词：Double图 撞击时间的期望值 随机游走 Randic ?矩阵 

分 类 号：R47[医药卫生—护理学]