Discrete-time random walks on diagrams (graphs) with cycles.
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...
Na minha lista:
| Publicado no: | Proc Natl Acad Sci U S A |
|---|---|
| Autor principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
National Academy of Sciences
1988
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC281752/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/3041408/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.85.15.5345 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|