IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i4d10.1007_s43069-024-00401-0.html
   My bibliography  Save this article

Finding Weakly Correlated Nodes in Random Variable Networks

Author

Listed:
  • Petr Koldanov

    (National Research University Higher School of Economics)

  • Alexander Koldanov

    (National Research University Higher School of Economics)

  • Dmitry Semenov

    (National Research University Higher School of Economics)

Abstract

The issue of identifying sets of weakly correlated stocks is explored. Four distinct methods for constructing these sets are compared: the traditional approach using Pearson correlation, the traditional approach using Kendall correlation, and multiple hypothesis testing methods, which apply both Pearson and Kendall correlations. To derive specific findings, we analyze daily returns of a selection of stocks listed on the Frankfurt (FWB), London (LSE), and Paris (Euronext Paris) stock exchanges. Our results reveal a significant difference between the identified sets of weakly correlated stocks in Pearson and Kendall correlation networks. Notably, this difference is more substantial in the statistically significant sets of weakly correlated stocks derived from multiple hypothesis testing methods than in those obtained through traditional procedures. We recommend for the use of multiple hypothesis testing methods based on Kendall correlation for analyzing market data.

Suggested Citation

  • Petr Koldanov & Alexander Koldanov & Dmitry Semenov, 2024. "Finding Weakly Correlated Nodes in Random Variable Networks," SN Operations Research Forum, Springer, vol. 5(4), pages 1-14, December.
  • Handle: RePEc:spr:snopef:v:5:y:2024:i:4:d:10.1007_s43069-024-00401-0
    DOI: 10.1007/s43069-024-00401-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00401-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-024-00401-0?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.

    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:spr:snopef:v:5:y:2024:i:4:d:10.1007_s43069-024-00401-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.