IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1107.3287.html
   My bibliography  Save this paper

On the Zipf strategy for short-term investments in WIG20 futures

Author

Listed:
  • B. Bieda
  • P. Chodorowski
  • D. Grech

Abstract

We apply the Zipf power law to financial time series of WIG20 index daily changes (open-close). Thanks to the mapping of time series signal into the sequence of 2k+1 'spin-like' states, where k=0, 1/2, 1, 3/2, ..., we are able to describe any time series increments, with almost arbitrary accuracy, as the one of such 'spin-like' states. This procedure leads in the simplest non-trivial case (k = 1/2) to the binary data projection. More sophisticated projections are also possible and mentioned in the article. The introduced formalism allows then to use Zipf power law to describe the intrinsic structure of time series. The fast algorithm for this implementation was constructed by us within Matlab^{TM} software. The method, called Zipf strategy, is then applied in the simplest case k = 1/2 to WIG 20 open and close daily data to make short-term predictions for forthcoming index changes. The results of forecast effectiveness are presented with respect to different time window sizes and partition divisions (word lengths in Zipf language). Finally, the various investment strategies improving ROI (return of investment) for WIG20 futures are proposed. We show that the Zipf strategy is the appropriate and very effective tool to make short-term predictions and therefore, to evaluate short-term investments on the basis of historical stock index data. Our findings support also the existence of long memory in financial data, exceeding the known in literature 3 days span limit.

Suggested Citation

  • B. Bieda & P. Chodorowski & D. Grech, 2011. "On the Zipf strategy for short-term investments in WIG20 futures," Papers 1107.3287, arXiv.org.
  • Handle: RePEc:arx:papers:1107.3287
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1107.3287
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:1107.3287. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.