Generating functions of waiting times and numbers of visits for random walks on graphs

DOI10.1007/S11009-011-9246-7zbMath1275.60057OpenAlexW2014133121MaRDI QIDQ352908

Sigeo Aki, Kiyoshi Inoue, Narayanaswamy Balakrishnan

Publication date: 5 July 2013

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-011-9246-7

zbMATH Keywords

generating functionsrandom walkswaiting timecover time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (1)

On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials

Cites Work

• On hitting times of random walks on trees
• Random walks on edge-transitive graphs. II
• The generating functions of hitting times for random walk on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generating functions of waiting times and numbers of visits for random walks on graphs