Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Transient Probabilit ...
Conference paper

Transient Probability Functions: A Sample Path Approach

Michael L. Green (1), Alan Krinik (1), Carrie Mortensen (1), Gerardo Rubino (2), Randall J. Swift (1)
(1) Department of Mathematics - Pomona College
(2) Architectures and network models
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2002
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Proceedings
DOI
10.46298/dmtcs.3349
License
https://about.hal.science/hal-authorisation-v1
Indicators
576
Views
755
Downloads

Transient Probability Functions: A Sample Path Approach

Michael L. Green (1), Alan Krinik (1), Carrie Mortensen (1), Gerardo Rubino (2), Randall J. Swift (1)
(1) Department of Mathematics - Pomona College
(2) Architectures and network models
Abstract
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.
Keywords
  • [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]
  • sample paths
  • dual processes
  • transient probability functions
  • Markov process
  • randomization.
Cited by

Source: OpenCitations

  • Dual processes to solve single server systems

    Journal of Statistical Planning and Inference

    Authors : Alan Krinik, Gerardo Rubino ORCID, Daniel Marcus, Randall J. Swift, Hassan Kasfy, Holly Lam

    Journal reference : Volume 135, 2005, pp. 121-147

    DOI : 10.1016/j.jspi.2005.02.010
Preview
Loading PDF preview...