{"title":"Stochastic Filtration for Moving Intensity of Poisson Flow with Random Jumps at Random Moments","authors":"O. A. Shorin, A. Shorin, G. O. Bokk","doi":"10.1109/SYNCHROINFO49631.2020.9166038","DOIUrl":null,"url":null,"abstract":"A wide range of events in Queuing networks, stock exchanges, and automatic systems can be described by a Poisson flow model with changing intensity that undergoes random jumps at a priori unknown moments. The direct solution of the identification problem in such conditions leads to algorithms with exponential complexity. An asymptotically optimal ML filtering algorithm for observed Poisson flow with polynomial computational complexity is proposed. It is shown that the optimal estimates of the moments of jumps must coincide with one of the moments of the observed events.","PeriodicalId":255578,"journal":{"name":"2020 Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNCHROINFO49631.2020.9166038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A wide range of events in Queuing networks, stock exchanges, and automatic systems can be described by a Poisson flow model with changing intensity that undergoes random jumps at a priori unknown moments. The direct solution of the identification problem in such conditions leads to algorithms with exponential complexity. An asymptotically optimal ML filtering algorithm for observed Poisson flow with polynomial computational complexity is proposed. It is shown that the optimal estimates of the moments of jumps must coincide with one of the moments of the observed events.