Skip to main content
Springer Nature Link
Log in

On Sequential Discrimination Between Close Markov Chains

  • Chapter
General Theory of Information Transfer and Combinatorics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4123))

  • 1899 Accesses

Abstract

The appropriateness of the Wald-type logarithmic asymptotics for the mean length of sequential discrimination strategies between close alternatives has been already challenged in the well-known controversy over comparative performances of the asymptotically optimal Chernoff’s discrimination strategies and ad hoc heuristic rules of Box and Hill in the seventies.

We continue this discussion by showing a poor performance of the Wald-type asymptotic bounds for the mean length of asymptotically optimal sequential discrimination strategies between the simplest types of Markov chains by simulation. We propose some weak remedies against this disaster and some alternative asymptotic tools.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Blot, W.J., Meeter, D.A.: Sequential experimental design procedures. Journal of the American Statistical Association 68(43), 586–593 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  2. Box, G.E.P., Hill, W.J.: Discrimination between mechanistic models. Technometrics 9, 57–71 (1967)

    Article  MathSciNet  Google Scholar 

  3. Chernoff, H.: Sequential Analysis and Optimal Design. SIAM, Philadelphia; Theoretical Statistics. Chapman and Hall, London (1972)

    Google Scholar 

  4. Lai, T.L.: Information bounds and quick detection of parameter changes in stochastic systems. IEEE Trans. Inform. Theory 44(7), 2917–2929 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Malyutov, M.B., Tsitovich, I.I.: Second order optimal sequential discrimination between Markov chains. Mathematical Methods of Statist. 10(4), 446–464 (2001)

    MATH  MathSciNet  Google Scholar 

  6. Sheffe, H.: Analysis of Variance. Wiley, N.Y. (1958)

    Google Scholar 

  7. Wald, A.: Sequential Analysis. Wiley, N.Y. (1947)

    MATH  Google Scholar 

Download references

Authors
  1. M. B. Malyutov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. M. Malyutov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 100131, 33501, Bielefeld, Germany

    Rudolf Ahlswede

  2. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Lars Bäumer , Ning Cai , Harout Aydinian  & Christian Deppe , ,  & 

  3. Russian Academy of Sciences Institute of Problems of Information Transmission, Bol’shoi Karetnyi per. 19, 101447, Moscow, Russia

    Vladimir Blinovsky

  4. Universität Bielefeld, Fakultät für Mathematik, Universitätsstr. 25, 33615, Bielefeld, Germany

    Haik Mashurian

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Malyutov, M.B., Malyutov, D.M. (2006). On Sequential Discrimination Between Close Markov Chains. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_30

Download citation

  • DOI: https://doi.org/10.1007/11889342_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics