Maximum likelihood estimation for stationary point processes
| dc.contributor.author | Puri, Madan L. | |
| dc.contributor.author | Tuan, Pham D. | |
| dc.date.accessioned | 2018-06-01T15:40:08Z | |
| dc.date.available | 2018-06-01T15:40:08Z | |
| dc.date.issued | 1986-02 | |
| dc.description | Publisher's, offprint version | |
| dc.description.abstract | In this paper we derive the log likelihood function for point processes in terms of their stochastic intensities by using the martingale approach. For practical purposes we work with an approximate log likelihood function that is shown to possess the usual asymptotic properties of a log likelihood function. The resulting estimates are strongly consistent and asymptotically normal (under some regularity conditions). As a by-product, a strong law of large numbers and a central limit theorem for martingales in continuous times are derived. | |
| dc.identifier.citation | Puri, M. L. "Maximum likelihood estimation for stationary point processes." Proceedings of the National Academy of Sciences (1986), U.S.A., Volume 83 Issue 3, 541–545. Co-author: Pham D. Tuan. | |
| dc.identifier.doi | https://doi.org/10.1073/pnas.83.3.541 | |
| dc.identifier.uri | https://hdl.handle.net/2022/22166 | |
| dc.language.iso | en | |
| dc.publisher | Proceedings of the National Academy of Sciences | |
| dc.relation.isversionof | http://www.pnas.org/content/83/3/541 | |
| dc.rights | This work may be protected by copyright unless otherwise stated. | |
| dc.subject | compensator | |
| dc.subject | stochastic intensity | |
| dc.subject | martingale | |
| dc.subject | natural increasing process | |
| dc.subject | point process | |
| dc.subject | predictable process | |
| dc.title | Maximum likelihood estimation for stationary point processes | |
| dc.type | Article |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Maximumlikelihoodestimation.pdf
- Size:
- 762.62 KB
- Format:
- Adobe Portable Document Format
- Description:
Collections
Can’t use the file because of accessibility barriers? Contact us