首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Decomposing Hitting Times of Walks on Graphs into Simpler Ones
Authors:Miguel Del Río  José Luis Palacios
Institution:1.Universidad Simón Bolívar,Caracas,Venezuela;2.Department of Electrical and Computing Engineering,University of New Mexico,Albuquerque,USA
Abstract:Using the electric approach, we derive a formula that expresses an expected hitting time of a random walk between two vertices a and b of a graph G as a convex linear combination of expected hitting times of walks between a and b on subgraphs of G, provided certain condition on a and b is satisfied. Then we use this formula in several applications.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号