Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs

被引：0
|
作者：
Inoue, Kiyoshi [1 ]
Aki, Sigeo [2 ]
Narayanaswamy, Balakrishnan [3 ]
机构：
[1] Seikei Univ, Fac Econ, Musashino, Tokyo 1808633, Japan
[2] Kansai Univ, Dept Math, Fac Engn Sci, Suita, Osaka 5648680, Japan
[3] McMaster Univ, Dept Math & Stat, Hamilton, ON L8S 4K1, Canada
来源：
METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY | 2013年 / 15卷 / 02期
关键词：
Random walk; Number of visits; Waiting time; Cover times; Hitting times; Graph; Tree; Expected value; Probability generating function; Double generating function; HITTING TIMES; TREES;
D O I：
10.1007/s11009-011-9246-7
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
In this paper, we consider some cover time problems for random walks on graphs in a wide class of waiting time problems. By using generating functions, we present a unified approach for the study of distributions associated with waiting times. In addition, the distributions of the numbers of visits for the random walks on the graphs are also studied. We present the relationship between the distributions of the waiting times and the numbers of visits. We also show that these theoretical results can be easily carried out through some computer algebra systems and present some numerical results for cover times in order to demonstrate the usefulness of the results developed. Finally, the study of cover time problems through generating functions leads to more extensive development.
引用
收藏
页码：349 / 362
页数：14
相关论文
共 50 条
  • [1] Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs
    Kiyoshi Inoue
    Sigeo Aki
    Balakrishnan Narayanaswamy
    Methodology and Computing in Applied Probability, 2013, 15 : 349 - 362
  • [2] Meeting times of random walks on graphs
    Bshouty, NH
    Higham, L
    Warpechowska-Gruca, J
    INFORMATION PROCESSING LETTERS, 1999, 69 (05) : 259 - 265
  • [3] NetGAN: Generating Graphs via Random Walks
    Bojchevski, Aleksandar
    Shchur, Oleksandr
    Zugner, Daniel
    Gunnemann, Stephan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [4] On generating functions of waiting times and numbers of occurrences of compound patterns in a sequence of multistate trials
    Inoue, Kiyoshi
    Aki, Sigeo
    JOURNAL OF APPLIED PROBABILITY, 2007, 44 (01) : 71 - 81
  • [5] The Hitting Times of Random Walks on Bicyclic Graphs
    Zhu, Xiaomin
    Zhang, Xiao-Dong
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2365 - 2386
  • [6] Hitting times for random walks on tricyclic graphs
    Zhu, Xiao-Min
    Yang, Xu
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023, 20 (01) : 65 - 72
  • [7] The Hitting Times of Random Walks on Bicyclic Graphs
    Xiaomin Zhu
    Xiao-Dong Zhang
    Graphs and Combinatorics, 2021, 37 : 2365 - 2386
  • [8] Hitting Times for Random Walks on Sierpiski Graphs and Hierarchical Graphs
    Qi, Yi
    Dong, Yuze
    Zhang, Zhongzhi
    Zhang, Zhang
    COMPUTER JOURNAL, 2020, 63 (09): : 1385 - 1396
  • [9] On the mean and variance of cover times for random walks on graphs
    Ball, F
    Dunham, B
    Hirschowitz, A
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1997, 207 (02) : 506 - 514
  • [10] Hitting times for random walks on subdivision and triangulation graphs
    Chen, Haiyan
    LINEAR & MULTILINEAR ALGEBRA, 2018, 66 (01): : 117 - 130
12345