Szajowski, Krzysztof (2008): On a random number of disorders. Forthcoming in: Probability and Mathematical Statistics : pp. 134.

PDF
MPRA_paper_20256.pdf Download (341kB)  Preview 
Abstract
We register a random sequence which has the following properties: it has three segments being the homogeneous Markov processes. Each segment has his own one step transition probability law and the length of the segment is unknown and random. It means that at two random successive moments (they can be equal also and equal zero too) the source of observations is changed and the first observation in new segment is chosen according to new transition probability starting from the last state of the previous segment. In effect the number of homogeneous segments is random. The transition probabilities of each process are known and a priori distribution of the disorder moments is given. The former research on such problem has been devoted to various questions concerning the distribution changes. The random number of distributional segments creates new problems in solutions with relation to analysis of the model with deterministic number of segments. Two cases are presented in details. In the first one the objectives is to stop on or between the disorder moments while in the second one our objective is to find the strategy which immediately detects the distribution changes. Both problems are reformulated to optimal stopping of the observed sequences. The detailed analysis of the problem is presented to show the form of optimal decision function.
Item Type:  MPRA Paper 

Original Title:  On a random number of disorders 
English Title:  On a Random Number of Disorders 
Language:  English 
Keywords:  disorder problem, sequential detection, optimal stopping, Markov process, change point, double optimal stopping 
Subjects:  C  Mathematical and Quantitative Methods > C0  General > C02  Mathematical Methods C  Mathematical and Quantitative Methods > C6  Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C61  Optimization Techniques ; Programming Models ; Dynamic Analysis C  Mathematical and Quantitative Methods > C1  Econometric and Statistical Methods and Methodology: General > C11  Bayesian Analysis: General 
Item ID:  20256 
Depositing User:  Krzysztof Szajowski 
Date Deposited:  27 Jan 2010 16:21 
Last Modified:  29 Sep 2019 11:48 
References:  Baron, M. (2004) Early detection of epidemics as a sequential changepoint problem. In Antonov,V., Huber, C., Nikulin, M., Polischook, V. (editors), Longevity, aging and degradation models in reliability, public health, medicine and biology, LAD 2004. Selected papers from the first FrenchRussian conference, St. Petersburg, Russia, June 79, 2004}, vol. 2 of IMS Lecture NotesMonograph Series, pp. 3143, St. Petersburg, Russia, 2004. St. Petersburg State Politechnical University. Basseville, M., Benveniste, A. (editors) (1986) Detection of abrupt changes in signals and dynamical systems, vol. 77 of Lecture Notes in Control and Information Sciences, pages 373, SpringerVerlag, Berlin. Bojdecki,T. (1979) Probability maximizing approach to optimal stopping and its application to a disorder problem. Stochastics, 3:6171. Bojdecki, T., Hosza, J. (1984) On a generalized disorder problem. Stochastic Processes Appl., 18:349359. Brodsky, B.E., Darkhovsky, B.S. (1993) Nonparametric Methods in ChangePoint Problems. Mathematics and its Applications (Dordrecht). 243. Dordrecht: Kluwer Academic Publishers. 224 p., Dordrecht. Dube, P., Mazumdar, R. (2001) A framework for quickest detection of traffic anomalies in networks. Technical report, Electrical and Computer Engineering, Purdue University, November 2001. citeseer.ist.psu.edu/506551.html. Fuh,Ch.D. (2004) Asymptotic operating characteristics of an optimal change point detection in hidden Markov models. Ann. Stat., 32(5):2305–2339, 2004. Haggstrom, G.W. (1967) Optimal sequential procedures when more then one stop is required. Ann. Math. Statist., 38:1618–1626. Lai, T. L.(1995) Sequential changepoint detection in quality control and dynamical systems (with discussion). J. R. Stat. Soc., Ser. B, 57(4):613–658. Lai, T.L. (1998) Information bounds and quick detection of parameter changes in stochastic systems. IEEE Trans. Inf. Theory, 44(7):2917–2929. Moustakides, G.V. (1998) Quickest detection of abrupt changes for a class of random processes. IEEE Trans. Inf. Theory, 44(5):1965–1968. Nikolaev, M.L. (1979) Obobshchennye posledovatelonye procedury. Litovski˘i Matematicheski˘i Sbornik, 19:35–44. Nikolaev, M.L. (1981) O kriterii optimal’nosti obobshchennoi posledovatel’noj procedury. Litov. Mat. Sb., 21:75–82, 1981. On the criterion of optimality of the extended sequential procedure (in Russian). Pelkowitz, L. (1987) The general discretetime disorder problem. Stochastics, 20:89–110, 1987. Pelkowitz, L. (1987) The general Markov chain disorder problem. Stochastics, 21:113–130, 1987. Sarnowski, W., Szajowski, K. (2008) Online detection of a part of a sequence with unspecified distribution. Stat. Probab. Lett., 78(15):2511–2516. doi:10.1016/j.spl.2008.02.040. Shewhart, W.A. (1931) Economic control of quality of manufactured products. D. Van Nostrand, Yew York, 1931. Shiryaev, A.N. (1961) The detection of spontaneous effects. Sov. Math, Dokl., 2:740–743, 1961. translation from Dokl. Akad. Nauk SSSR 138, 799801. Shiryaev, A.N. (1978) Optimal Stopping Rules. SpringerVerlag, New York, Heidelberg, Berlin, 1978. Szajowski, K. (1992) Optimal online detection of outside observation. J.Stat. Planning and Inference, 30:413–426. Szajowski, K. (1996) A twodisorder detection problem. Appl. Math., 24(2):231–241. Tartakovsky, A. G., Rozovskii, B. L., Blažek, R. B., Kim, H. (2006) Detection of intrusions in information systems by sequential changepoint methods. Stat. Methodol., 3(3):252–293. Tartakovsky, A.G., Veeravalli, V.V. (2008) Asymptotically optimal quickest change detection in distributed sensor systems. Sequential Anal., 27(4):441–475. Yakir, B. (1994) Optimal detection of a change in distribution when the observations form a Markov chain with a finite state space. In Carlstein, E., Mueller, H.G., Siegmund, D. (editors), Changepoint Problems. Papers from the AMSIMSSIAM Summer Research Conference held at Mt. Holyoke College, South Hadley, MA, USA, July 11–16, 1992, volume 23 of IMS Lecture NotesMonograph Series, pages 346–358, Hayward, California, 1994. Institute of Mathematical Statistics. Yoshida, M. (1983) Probability maximizing approach for a quickest detection problem with complicated Markov chain. J. Inform. Optimization Sci., 4:127–145. 
URI:  https://mpra.ub.unimuenchen.de/id/eprint/20256 