IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v48y2019i4p986-994.html
   My bibliography  Save this article

On convergence rate for weighted sums of arrays of rowwise ANA random variables

Author

Listed:
  • Rui Yang
  • Zhaojing Jing
  • Yan Shen

Abstract

Let {Xnk, k ⩾ 1, n ⩾ 1} be an array of rowwise ANA random variables stochastically dominated by a random variable X, and {ank, 1 ⩽ k ⩽ n, n ⩾ 1} be an array of real numbers with ∑k=1n|ank|α=O(n)$\sum \nolimits _{k=1}^{n}|a_{nk}|^{\alpha }=O(n)$ for some 0 ⩽ α ⩽ 2. Under the almost optimal moment conditions, the paper shows that ∑n=1∞n-1Pmax1≤m≤n∑k=1mankXnk>εn1α(logn)1γ 0. \begin{equation*} \sum \limits _{n=1}^{\infty }n^{-1}P\left\lbrace \max \limits _{1\le m\le n}\left|\sum \limits _{k=1}^{m}a_{nk}X_{nk}\right|>\varepsilon n^{\frac{1}{\alpha }}(\log n)^{\frac{1}{\gamma }}\right\rbrace 0. \end{equation*} In addition, we can get the strong law of large numbers for sequence of ANA random variables as application of our Theorem.

Suggested Citation

  • Rui Yang & Zhaojing Jing & Yan Shen, 2019. "On convergence rate for weighted sums of arrays of rowwise ANA random variables," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(4), pages 986-994, February.
  • Handle: RePEc:taf:lstaxx:v:48:y:2019:i:4:p:986-994
    DOI: 10.1080/03610926.2017.1422760
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1422760
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2017.1422760?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:48:y:2019:i:4:p:986-994. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.