StockMarkNetIndicator:“网络几何和市场不稳定”的存储库

  • Q2_489912
    了解作者
  • 399.7KB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • VIP专享
    资源类型
  • 0
    下载次数
  • 2022-05-18 08:33
    上传日期
股市网络指标 “ StockMarkNetIndicators”存储库中的代码可用于过滤金融市场中股票的互相关矩阵,以基于最小生成树(MST)和所选阈值构建股票网络。 此后,可以通过计算包括基于边缘的曲率量度在内的几种网络量度来表征边缘列表或文件形式的已过滤网络。 构造的网络采用边缘列表形式,并传递给进一步调查。 代码详细信息: 以下脚本可用于过滤互相关矩阵,并生成过滤后的网络的边缘文件和节点文件: mst_wt.py:Python脚本,用于从互相关值的加权网络中生成加权或未加权的已过滤最小生成树+阈值网络。 当da常数大于1(稀疏状态)时,在pn = d / n方案中,Erdös-Renyi随机图G(n,pn)的分量具有零频谱间隙,即n→∞。 这与较早的结果相反,当np n = O(log 2(n))时,光谱间隙存在。 我们还证明,对于任何δ>,在pn = d / n的情况下; 0E
StockMarkNetIndicator-main.zip
内容介绍
# Stock Market Network Indicators The codes in the 'StockMarkNetIndicators' repository can be used to filter cross-correlation matrices of stocks in a financial market to construct network of stocks based on Minimum Spanning Tree (MST) and a chosen threshold. Thereafter, the filtered network in the form of edge list or file can be characterized by computing several network measures including edge-based curvature measures. The constructed network is in the edge list form and is passed on for the further investigations. ## Code Details: ### The following script can be used to filter the cross-correlation matrices and generate edge files and node files of the filtered networks: * mst_wt.py : Python script to generate a weighted or unweighted filtered minimum spanning tree + thresholded network from the weighted network of cross-correlation values. The omponent of the Erdös-Renyi random graph G(n, p n ) in the regime p n = d/n for d a constant greater than 1 (sparse regime) has zero spectral gap as n → ∞. This is in contrast to earlier results showing the existence of a spectral gap when np n = O(log 2 (n)). We also prove that in the regime p n = d/n, for any δ >; 0 the Erdös-Renyi random graph has a positive probability of containing δ-fat triangles as n → ∞, thus showing that these graphs are asymptotically non-hyperbolic.weights are interpreted as distances (costs). ### The following scripts can be used to compute the different network measures for the filtered networks: * comm_eff.py : Python script to calculate the communcation efficiency of the network * FormanUndirected.cpp : C++ code to calculate the Forman-Ricci curvature of edges in the network * graph_measures.py : Python script to calculate the following measures on the network, namely, Number of edges, Average degree, Average Weighted Degree, Edge Density, Average Clustering coefficient * MengerHaantjesUndirected.py : Python script to compute Menger-curvature and Haantjes-curvature for all the edges in an unweighted network * network_entropy.py : Python script to calculate network entropy using degree and remaining degree distribution. * OR-Undir.py : Python script to compute the Ollivier-Ricci curvature of edges in the network. * Folder 'louvain-generic' within folder 'CODE' contains the code to compute the Louvain modularity of the network. This is a copy of the open source code made available by the original authors of the method. To run: (1) ./louvain-generic/convert -i "insert edge file" -o ./temp/$folder/graph.bin -w ./temp/$folder/graph.weights (2) ./louvain-generic/louvain ./temp/$folder/graph.bin -w ./temp/$folder/graph.weights >& ./temp/$folder/graph.tree ### The following MATLAB 2020a program can be used to compute different traditional market indicators: * analysis_matlab.m : Matlab codes to generate index log-returns, mean market correlation, GARCH volatility, minimum risk Markowitz portfolio. The moving epochs and the price time series are the input parameters. ## Data description: * The data was collected from the public domain of Yahoo finance database for two stock markets in two different countries, namely, USA S&P-500 index for 194 stocks and Japanese Nikkei-225 index for 165 stocks spanning a 32-year period from 2 January 1985 (02-01-1985) to 30 December 2016 (30-12-2016). * Archived folders 'USA22d22s' and 'JPN22d22s' contain cross-correlation matrices computed using non-overlapping time windows with epoch of 22 days while folders 'USA22d5s' and 'JPN22d5s' contain cross-correlation matrices computed using overlapping time windows with epoch of 22 days and overlap of 5 days. These cross-correlation matrices were used in the construction of the networks. The above-mentioned archived folder can be downloaded from : (1) Folder 'USA22d22s' - https://www.imsc.res.in/~asamal/data/StockMarkIndicators/USA22d22s.tar.gz (2) Folder 'USA22d5s' - https://www.imsc.res.in/~asamal/data/StockMarkIndicators/USA22d5s.tar.gz (3) Folder 'JPN22d22s' - https://www.imsc.res.in/~asamal/data/StockMarkIndicators/JPN22d22s.tar.gz (4) Folder 'JPN22d5s' - https://www.imsc.res.in/~asamal/data/StockMarkIndicators/JPN22d5s.tar.gz * The cross-correlation matrices contained in different files in the above-mentioned archived folders are in the form: stock1 stock2 Correlation Distance where distance is computed as Dist=sqrt(2(1-c)) with c as correlation. * The files USA22d5s.xlsx, USA22d22s.xlsx, JPN22d5s.xlsx and JPN22d22s.xlsx contain dictionaries relating cross-correlation matrices in the folders 'USA22d5s', 'USA22d22s', 'JPN22d5s' and 'JPN22d22s', respectively, and the start date / end date of different cross-correlation matrices. ### These codes were written while carrying out research reported in the following manuscripts: [1] A. Samal, H.K. Pharasi, S. J. Ramaia, H. Kannan, E. Saucan, J. Jost & A. Chakraborti, Network geometry and market instability, R. Soc. Open Sci. 8: 201734 (2021).</br> [2] S. Venkatesan, R.P. Vivek-Ananth, R.P. Sreejith, P. Mangalapandi, A.A. Hassanali & A. Samal, Network approach towards understanding the crazing in glassy amorphous polymers, Journal of Statistical Mechanics: Theory and Experiment 043305 (2018). [3] A. Samal, R.P. Sreejith, J. Gu, S. Liu, E. Saucan & J. Jost, Comparative analysis of two discretizations of Ricci curvature for complex networks, Scientific Reports 8: 8650 (2018). [4] R.P. Sreejith, K. Mohanraj, J. Jost, E. Saucan & A. Samal, Forman curvature for complex networks, Journal of Statistical Mechanics: Theory and Experiment 063206 (2016). #### Please cite the above manuscripts if you use the codes in this repository for your work.
评论
    相关推荐