Generating functions of waiting times and numbers of visits for random walks on graphs (Q352908)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating functions of waiting times and numbers of visits for random walks on graphs |
scientific article; zbMATH DE number 6184661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating functions of waiting times and numbers of visits for random walks on graphs |
scientific article; zbMATH DE number 6184661 |
Statements
Generating functions of waiting times and numbers of visits for random walks on graphs (English)
0 references
5 July 2013
0 references
The authors study generalized cover time problems for random walks on graphs using generating function formalism. They formalize the cover time problems as waiting time problems on Markov chains. The relationship between the distributions of the numbers of visits and the waiting times is given. Executable algorithms for solving the generating functions are provided. Numerical examples are also provided to illustrate the main results on a complete graph.
0 references
random walks
0 references
cover time
0 references
waiting time
0 references
generating functions
0 references
0.8049148917198181
0 references
0.7975790500640869
0 references
0.7837441563606262
0 references
