Skip to main content

Complete Convergence for NA Random Sequence

  • Conference paper
Information Computing and Applications (ICICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 307))

Included in the following conference series:

  • 1097 Accesses

Abstract

The classical complete convergence theorem concerns the arithmetic means which is a regular method of summability. In this paper, to obtain the main results, a new large class of summability methods is introduced. The results for complete convergence for negatively associated random variable sequence are obtained. To investigate this results, by restricting the moment conditions and use a new method of summability. Then the result of the complete convergence for NA random variables sequences are obtained by applying the Kolmogorov-type inequality for NA random variable sequence.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Joag-Dev, K., Proschan, F.: Negative association of random variables with applications. Ann. Statistic. 11, 286–295 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hsu, P.L., Robbins, H.: Complete convergence and the low of large numbers. Proc. Nat. Acad. Sci. USA 33, 25–31 (1947)

    Article  MATH  MathSciNet  Google Scholar 

  3. Shao, Q.-M., Su, C.: The Law of iterated logarithm for negatively associated random variables. Process. Appl. 83, 139–148 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lin, Z., Lu, C., Su, Z.: Foundations of probability limit theory. College Mathematics Journal, 98–106 (1999)

    Google Scholar 

  5. Christofiders, T.C., Vaggelatou, E.: A connection between supermodular ordering and positive/negative association. Journal of Multivariate Analysis 88, 138–151 (2004)

    Article  MathSciNet  Google Scholar 

  6. Liu, L., Sheng, S.: On Sufficient and Necessary Condition of a Strong Law of Large Numbers for Negatively Associated Random Variables. Chinese Journal of Applied Probability and Statistics 24(4) (2008)

    Google Scholar 

  7. Zhou, S.-N., Ming, R.-X., Huang, L.: Complete Convergence for Randomly Weighted Sums of Negatively Associated Random Variables. Journal of Jiangxi Normal University (natural sciences edition), 33(6) (2009)

    Google Scholar 

  8. Liang, H., Zhang, J.: Strong Convergence for Weighted Sums of Negatively Associated Arrays. Chinese Annals of Mathematics, Series B 31(2) (2010)

    Google Scholar 

  9. Xing, G., Yang, S.: Exponential Inequalities for Negatively Associated Random Variables. Acta Mathematica Scientia, 29(6) (2009)

    Google Scholar 

  10. Christofides, T.C., Hadjikyriakou, M.: Exponential inequalities for N-demimartingales and negatively associated random variables. Statistics & Probability Letters 79(19) (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Liu, Y., Tan, Y. (2012). Complete Convergence for NA Random Sequence. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34038-3_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34037-6

  • Online ISBN: 978-3-642-34038-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics