Estimating the residual waiting time for binary stationary time series

Gusztáv Morvai*, Benjamin Weiss

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

We present here a universal estimation scheme for the problem of estimating the residual waiting time until the next occurrence of a zero after observing the first n outputs of a stationary and ergodic binary process. The scheme will involve estimating only at carefully selected stopping times but will be almost surely consistent. In case the process happens to be a genuine renewal process then our stopping times will have asymptotic density one.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages67-70
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece
Duration: 10 Jun 200912 Jun 2009

Publication series

NameProceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Conference

Conference2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Country/TerritoryGreece
CityVolos
Period10/06/0912/06/09

Fingerprint

Dive into the research topics of 'Estimating the residual waiting time for binary stationary time series'. Together they form a unique fingerprint.

Cite this