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

DOI10.1007/S11009-011-9246-7zbMATH Open1275.60057OpenAlexW2014133121MaRDI QIDQ352908FDOQ352908

Authors: Kiyoshi Inoue, Sigeo Aki, 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

Recommendations

• Publication:4502527
• On the mean and variance of cover times for random walks on graphs
• On the cover time of random walks on graphs
• scientific article; zbMATH DE number 109323
• On a cover time problem on a dynamic graph with steps at random times

zbMATH Keywords

generating functionsrandom walkscover timewaiting time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On hitting times of random walks on trees
• Random walk and fluctuation theory
• Random walks on edge-transitive graphs. II
• The generating functions of hitting times for random walk on trees
• Title not available (Why is that?)

Cited In (4)

• On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials
• Application of generating functions to problems of random walk
• A generating function for the second moment of the distinct number of sites visited by an n-step lattice random walk
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352908)