 |
Discrete Mathematics & Theoretical Computer Science |
Michael L. Green ; Alan Krinik ; Carrie Mortensen ; Gerardo Rubino ; Randall J. Swift - Transient Probability Functions: A Sample Path Approach
dmtcs:3349 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) - https://doi.org/10.46298/dmtcs.3349Transient Probability Functions: A Sample Path ApproachArticle
- 1 Department of Mathematics - Pomona College
- 2 Architectures and network models
A new approach is used to determine the transient probability functions of Markov processes. This new solution method is a sample path counting approach and uses dual processes and randomization. The approach is illustrated by determining transient probability functions for a three-state Markov process. This approach also provides a way to calculate transient probability functions for Markov processes which have specific sample path characteristics.
Source: HAL:hal-01183945v1
Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Imported on: May 10, 2017
Keywords: sample paths,dual processes,transient probability functions,Markov process,randomization.,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]
1 Document citing this article
Consultation statistics
This page has been seen 198 times.
This article's PDF has been downloaded 374 times.