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.

    References listed on IDEAS

    as
    1. Millington, Tristan & Niranjan, Mahesan, 2021. "Stability and similarity in financial networks—How do they change in times of turbulence?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 574(C).
    2. Kalyagin, V.A. & Koldanov, A.P. & Koldanov, P.A., 2022. "Reliability of maximum spanning tree identification in correlation-based market networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 599(C).
    3. Kalyagin, V.A. & Koldanov, A.P. & Koldanov, P.A. & Pardalos, P.M. & Zamaraev, V.A., 2014. "Measures of uncertainty in market network analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 59-70.
    4. J.-P. Onnela & K. Kaski & J. Kertész, 2004. "Clustering and information in correlation based financial networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 38(2), pages 353-362, March.
    5. Boginski, Vladimir & Butenko, Sergiy & Pardalos, Panos M., 2005. "Statistical analysis of financial networks," Computational Statistics & Data Analysis, Elsevier, vol. 48(2), pages 431-443, February.
    6. Millington, Tristan & Niranjan, Mahesan, 2021. "Construction of minimum spanning trees from financial returns using rank correlation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nie, Chun-Xiao, 2022. "Analysis of critical events in the correlation dynamics of cryptocurrency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(C).
    2. Dmitry Semenov & Alexander Koldanov & Petr Koldanov, 2024. "Analysis of weakly correlated nodes in market network," Computational Management Science, Springer, vol. 21(1), pages 1-18, June.
    3. Teh, Boon Kin & Goo, Yik Wen & Lian, Tong Wei & Ong, Wei Guang & Choi, Wen Ting & Damodaran, Mridula & Cheong, Siew Ann, 2015. "The Chinese Correction of February 2007: How financial hierarchies change in a market crash," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 225-241.
    4. Xue Guo & Hu Zhang & Tianhai Tian, 2019. "Multi-Likelihood Methods for Developing Stock Relationship Networks Using Financial Big Data," Papers 1906.08088, arXiv.org.
    5. Gang-Jin Wang & Chi Xie & Kaijian He & H. Eugene Stanley, 2017. "Extreme risk spillover network: application to financial institutions," Quantitative Finance, Taylor & Francis Journals, vol. 17(9), pages 1417-1433, September.
    6. Výrost, Tomáš & Lyócsa, Štefan & Baumöhl, Eduard, 2015. "Granger causality stock market networks: Temporal proximity and preferential attachment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 427(C), pages 262-276.
    7. Li, Jianxuan & Shi, Yingying & Cao, Guangxi, 2018. "Topology structure based on detrended cross-correlation coefficient of exchange rate network of the belt and road countries," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 1140-1151.
    8. Frank Emmert-Streib & Matthias Dehmer, 2010. "Influence of the Time Scale on the Construction of Financial Networks," PLOS ONE, Public Library of Science, vol. 5(9), pages 1-9, September.
    9. Dimitris Andriosopoulos & Michalis Doumpos & Panos M. Pardalos & Constantin Zopounidis, 2019. "Computational approaches and data analytics in financial services: A literature review," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(10), pages 1581-1599, October.
    10. Cheong, Siew Ann & Fornia, Robert Paulo & Lee, Gladys Hui Ting & Kok, Jun Liang & Yim, Woei Shyr & Xu, Danny Yuan & Zhang, Yiting, 2011. "The Japanese economy in crises: A time series segmentation study," Economics Discussion Papers 2011-24, Kiel Institute for the World Economy (IfW Kiel).
    11. Xu, Shiyun & Shao, Menglin & Qiao, Wenxuan & Shang, Pengjian, 2018. "Generalized AIC method based on higher-order moments and entropy of financial time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 1127-1138.
    12. Bilal Ahmed Memon & Rabia Tahir, 2021. "Examining Network Structures and Dynamics of World Energy Companies in Stock Markets: A Complex Network Approach," International Journal of Energy Economics and Policy, Econjournals, vol. 11(4), pages 329-344.
    13. Ren, Yinghua & Zhao, Wanru & You, Wanhai & Zhu, Huiming, 2022. "Multiscale features of extreme risk spillover networks among global stock markets," The North American Journal of Economics and Finance, Elsevier, vol. 62(C).
    14. Millington, Tristan & Niranjan, Mahesan, 2021. "Construction of minimum spanning trees from financial returns using rank correlation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    15. Guo, Xue & Li, Weibo & Zhang, Hu & Tian, Tianhai, 2022. "Multi-likelihood methods for developing relationship networks using stock market data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 585(C).
    16. Zhu, Jia & Wei, Daijun, 2021. "Analysis of stock market based on visibility graph and structure entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 576(C).
    17. Stephan Bialonski & Martin Wendler & Klaus Lehnertz, 2011. "Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks," PLOS ONE, Public Library of Science, vol. 6(8), pages 1-13, August.
    18. Grigory Bautin & Valery Kalyagin & Alexander Koldanov & Petr Koldanov & Panos Pardalos, 2013. "Simple measure of similarity for the market graph construction," Computational Management Science, Springer, vol. 10(2), pages 105-124, June.
    19. Zięba, Damian, 2024. "If GPU(time) == money: Sustainable crypto-asset market? Analysis of similarity among crypto-asset financial time series," International Review of Economics & Finance, Elsevier, vol. 89(PB), pages 863-912.
    20. Tristan Millington & Mahesan Niranjan, 2020. "Construction of Minimum Spanning Trees from Financial Returns using Rank Correlation," Papers 2005.03963, arXiv.org, revised Nov 2020.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.