%0 Journal Article
%T Double图的撞击时间的期望值<br>Expected Hitting Time of Double Graphs
%A 孙春雨
%J Pure Mathematics
%P 472-476
%@ 2160-7605
%D 2021
%I Hans Publishing
%R 10.12677/PM.2021.114060
%X <div style=\"text-align:justify;\">
	令G为简单连通图，D<sub>G</sub>为其double图，称图G的随机游走从点u首次到达点v所需步数的期望值为点u到点v的撞击时间的期望值。本文给出了D<sub>G</sub>和G中任意两点撞击时间的期望值之间的关系。<br />
Let G be a simple connected graph and let D<sub>G</sub> 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 D<sub>G</sub> and G is displayed.
</div>
%K Double图，撞击时间的期望值，随机游走，Randic ?矩阵<br>Double Graph
%K Expected Hitting Time
%K Random Walk
%K Randi? Matrix
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=41565