Transformations of Poisson Processes: Particle Systems and Networks

  • Richard F. Serfozo
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 19)

Abstract

This study is dedicated to Julian Keilson, who was one of my earliest academic friends. Our many discussions were often sprinkled with his inquisitive and insightful questions about our research and his musings about the relevance of applied probability. One of his traits was to strive to uncover the essence of a matter and to present major ideas in a simple form. That is the spirit in which I approached this chapter. Its focus is on simple proofs of transformations of Poisson processes and their applications to particle systems and to networks of M/G/∞ service stations. Such networks were the subject of Keilson and Servi [9].

Keywords

Poisson Process Point Process Particle System Location Process Attribute Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Brown, M. A property of Poisson processes and its application to macroscopic equilibrium of particle systems. Ann. Math. Stat. 41, 1935–1941, 1970.MATHCrossRefGoogle Scholar
  2. [2]
    Brown, M. Low density traffic streams. Adv. Appl. Prob. 4, 177–192, 1972.MATHCrossRefGoogle Scholar
  3. [3]
    Brown, M., and Ross, S. M. Some results for infinite server Poisson queues. J. Appl. Prob. 6, 604–611, 1969.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    Cinlar, E., and Kao, J. S. Particle systems on flows. In: Applied Stochastic Models and Data Analysis. John Wiley, New York, 1992.Google Scholar
  5. [5]
    Daley, D. J., and Vere-Jones, D. An Introduction to the Theory of Point Processes. Springer, New York, 1988.MATHGoogle Scholar
  6. [6]
    Derman, C. Some contributions to the theory of denumerable Markov chains. Trans. Am. Math. Soc. 79, 541–555, 1955.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    Foley, R. The non-homogeneous M/G/∞ queue. Opsearch 19, 40–48, 1982.MathSciNetGoogle Scholar
  8. [8]
    Karlin, S. A First Course in Stochastic Processes. Academic Press, Now York, 1966.Google Scholar
  9. [9]
    Keilson, J., and Servi, L. D. Networks of non-homogeneous M/G/∞ systems. Studies in Applied Probability. J. Appl. Probability 31A, 157–168, 1994.MathSciNetCrossRefGoogle Scholar
  10. [10]
    Kingman, J. F. C. Poisson Processes. Oxford University Press, Oxford, 1993.MATHGoogle Scholar
  11. [11]
    Massey, W. A., and W. Whitt. Networks of infinite-server queues with nonstationary Poisson input. Queueing Sys. 13, 183–250, 1993.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    Phelan, M. J. A Girsanov transformation for birth and death on a Brownian flow. J. Apl. Prob. 33, 88–100, 1996.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    Serfozo, R. Point processes. In: Heyman, D. P., and Sobel, M. J. (eds), Stochastic Models. North Holland, Amsterdam, 1990, pp. 1–93.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Richard F. Serfozo

There are no affiliations available

Personalised recommendations