Discrete-time random walks on diagrams (graphs) with cycles.

AUTOR(ES)

Hill, T L

RESUMO

After a review of the diagram method for continuous-time random walks on graphs with cycles, the method is extended to discrete-time random walks. The basic theorems carry over formally from continuous time to discrete time. Three problems in tennis probabilities are used to illustrate random walks on discrete-time diagrams with cycles.

Documentos Relacionados

• Interrelations between random walks on diagrams (graphs) with and without cycles.
• Further properties of random walks on diagrams (graphs) with and without cycles.
• Stable cycling in discrete-time genetic models.
• Polyhedral regions of local stability for linear discrete-time systems with saturating controls
• Updating of a Nonlinear Finite Element Model Using Discrete-Time Volterra Series