Poisson Process

Arjun K. Gupta (), Wei-Bin Zeng () and Yanhong Wu ()
Additional contact information
Arjun K. Gupta: Bowling Green State University, Department of Mathematics and Statistics
Wei-Bin Zeng: University of Louisville, Department of Mathematics
Yanhong Wu: California State University Stanislaus, Department of Mathematics

Chapter Chapter 3 in Probability and Statistical Models, 2010, pp 45-70 from Springer

Abstract: Abstract Consider a certain event that occurs consecutively at random time points $$0 0, i.e., $$N(t) =\sup \{ n :\ {T}_{n} \leq t\},\ \ \mathrm{for}\ \ t > 0.$$ We call N(t),t≥0 a counting process. For each t>0, N(t) could represent the number of accidents at a particular intersection, the number of times a computer breaks down, or similar counts.

Keywords: Poisson Process; Renewal Process; Soccer Player; Moment Generate Function; Interarrival Time (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4987-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9780817649876

DOI: 10.1007/978-0-8176-4987-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().