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...
Gorde:
| Argitaratua izan da: | Proc Natl Acad Sci U S A |
|---|---|
| Egile nagusia: | |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
National Academy of Sciences
1988
|
| Gaiak: | |
| Sarrera elektronikoa: | 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 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|