A new algorithm PD improves stock-correlation network clustering and robustness.
problem Improving clustering and robustness of stock-correlation networks.
method Proposes a new proportional degree algorithm to filter information on a complete graph of normalised mutual information.
result The PD algorithm produces a network with better homogeneity and robustness compared to PMFG.
GRU-PFG model extracts inter-stock correlations from stock factors using graph neural networks.
problem Limited effectiveness of models relying solely on stock factors for capturing stock correlations.
method Project stock factors into a graph and use graph neural networks to extract inter-stock correlations.
result Achieves better prediction results than models relying solely on stock factors and comparable to second category models.
Paper forecasts stock correlations using a hybrid model combining graph neural networks and transformers.
problem Improving stock correlation forecasts for better portfolio management.
method Hybrid model combining Transformer and graph attention networks for forecasting residual deviations from historical data.
result The hybrid model reduces correlation forecasting error compared to rolling-window estimates.
Algorithm learns stock correlation matrix embedding using graph machine learning.
problem Understanding complex relationships among stocks based on their correlation matrix.
method Proposes a graph machine learning approach called Node2Vec to compress the correlation network into an embedding.
result The algorithm can learn an embedding from the correlation network of S&P 500 stock data.
Stock correlations is crucial to asset pricing, investor decision-making, and financial risk regulations. However, microscopic explanation based on agent-based modeling is still lacking. We here propose a model derived from minority game for modeling stock correlations, in which an agent's expected return for one stock…
Paper uses HPCA for better stock correlation modeling.
problem Challenges in modeling cross-sectional correlations between thousands of stocks.
method Hierarchical Principal Component Analysis (HPCA) and statistical clustering.
result HPCA provides better cross-sectional correlations than classic PCA.
We study the inter-stock correlations for the largest companies listed on Warsaw Stock Exchange and included in the WIG20 index. Our results from the correlation matrix analysis indicate that the Polish stock market can be well described by a one factor model. We also show that the stock-stock correlations tend to incr…
We highlight a very simple statistical tool for the analysis of financial bubbles, which has already been studied in [1]. We provide extensive empirical tests of this statistical tool and investigate analytically its link with stocks correlation structure.
The credit crisis roiling the world's financial markets will likely take years and entire careers to fully understand and analyze. A short empirical investigation of the current trends, however, demonstrates that the losses in certain markets, in this case the US equity markets, follow a cascade or epidemic flow like m…
Study detects signal in financial stock correlations using phase-ordering kinetics.
problem Detecting meaningful signals in financial stock return correlations.
method Stochastic field theory model to establish a detection threshold.
result Detection of a signal in the largest eigenvalues of the stock return correlation matrix.
We follow the main stocks belonging to the New York Stock Exchange and to Nasdaq from 2003 to 2012, through years of normality and of crisis, and study the dynamics of networks built on two measures expressing relations between those stocks: correlation, which is symmetric and measures how similar two stocks behave, an…
New method selects edges in stock networks using multiple threshold values.
problem Balancing prominent correlations and network connectivity in stock networks.
method Uses multiple distributions in a maximum likelihood estimator for selecting threshold values.
result Proposed method develops networks with appropriate connectivities.
New tensor-based method for estimating stock correlation matrices.
problem Choosing a proper sample period for estimating correlation matrices.
method Slice-Diagonal Tensor (SDT) factorization technique.
result The new method produces a stable correlation matrix unaffected by the sample period.
We find a novel correlation structure in the residual noise of stock market returns that is remarkably linked to the composition and stability of the top few significant factors driving the returns, and moreover indicates that the noise band is composed of multiple subbands that do not fully mix. Our findings allow us …
The investment on the stock market is prone to be affected by the Internet. For the purpose of improving the prediction accuracy, we propose a multi-task stock prediction model that not only considers the stock correlations but also supports multi-source data fusion. Our proposed model first utilizes tensor to integrat…
Geography effect is investigated for the Chinese stock market including the Shanghai and Shenzhen stock markets, based on the daily data of individual stocks. The Shanghai city and the Guangdong province can be identified in the stock geographical sector. By investigating a geographical correlation on a geographical pa…
Closed form option pricing formulae explaining skew and smile are obtained within a parsimonious non-Gaussian framework. We extend the non-Gaussian option pricing model of L. Borland (Quantitative Finance, {\bf 2}, 415-431, 2002) to include volatility-stock correlations consistent with the leverage effect. A generalize…
New models explain multidimensional rough volatility from microscopic price dynamics.
problem Designing new rough stochastic volatility models for multi-asset scenarios.
method Using Hawkes processes to model microstructural interactions and investigate scaling limits.
result Multivariate rough volatility models arise naturally from microscopic price dynamics.
We study the dynamic evolution of cross-correlations in the Chinese stock market mainly based on the random matrix theory (RMT). The correlation matrices constructed from the return series of 367 A-share stocks traded on the Shanghai Stock Exchange from January 4, 1999 to December 30, 2011 are calculated over a moving …
Study shows foreign institutional investment increases liquidity commonality in large Australian stocks.
problem Impact of foreign institutional investment on liquidity commonality in Australian stocks.
method Cross-sectional and time-series analysis of Australian equity market data.
result Foreign institutional investment contributes to increased exposure of large stocks to unexpected liquidity events.
A spring-block chain placed on a running conveyor belt is considered for modeling stylized facts observed in the dynamics of stock indexes. Individual stocks are modeled by the blocks, while the stock-stock correlations are introduced via simple elastic forces acting in the springs. The dragging effect of the moving be…
Study shows adding correlated features doesn't improve LSTM model interpretability for oil stocks.
problem Improving interpretability of LSTM models for predicting oil company stocks.
method Designed and trained Standard LSTM networks using various correlated datasets.
result Adding correlated features does not enhance LSTM model interpretability.
New method separates market motion from stock correlations.
problem Understanding the dynamics of stock correlations relative to market motion.
method Cluster reduced-rank correlation matrices by subtracting the largest eigenvalue.
result Extracted market states are quasi-stationary over long periods.
The study identifies persistent motifs in stock correlations for sector-neutral portfolio diversification.
problem Forecasting and diversification of sector-neutral portfolios using long-term correlations.
method Analysis of Triangulated Maximally Filtered Graphs (TMFG) generated from rolling windows of stock price log-returns, identifying persistent motifs.
result Persistent motifs in stock correlations can be used to forecast and diversify sector-neutral portfolios, reducing volatility.
StockTime predicts stock prices more accurately using LLMs and time series data.
problem Challenges in integrating time series data and natural language for stock price prediction.
method StockTime is a specialized LLM architecture that integrates textual and time series data to predict stock prices.
result StockTime outperforms recent LLMs in predicting stock prices with more accuracy.
Traditional stock market prediction approaches commonly utilize the historical price-related data of the stocks to forecast their future trends. As the Web information grows, recently some works try to explore financial news to improve the prediction. Effective indicators, e.g., the events related to the stocks and the…
NYSE stock prices show persistent correlations over years, exploitable through arbitrage strategies.
problem Predicting and exploiting long-term price correlations in NYSE stocks.
method Analyzed 1000 NYSE stocks over 5 years, measured discrepancies from Brownian motion, and tested arbitrage strategies.
result 45% of a stock's 1-hour returns variance is explained by cross-correlations with other stocks, especially during high volatility periods.
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.
Paper links network Lasso to network flow optimization.
problem Joint clustering and optimization of networked data.
method Exploration of duality between network Lasso and network flow optimization.
result nLasso is equivalent to a minimum-cost flow problem on the data network structure.
Taking inspiration from biological evolution, we explore the idea of "Can deep neural networks evolve naturally over successive generations into highly efficient deep neural networks?" by introducing the notion of synthesizing new highly efficient, yet powerful deep neural networks over successive generations via an ev…
SyNGLER generates synthetic networks efficiently while preserving key structural properties.
problem Efficiently generating realistic synthetic networks with preserved structural properties.
method SyNGLER uses latent space network models to learn and reconstruct node embeddings, then generates synthetic networks.
result SyNGLER produces synthetic networks that better preserve key network characteristics than existing approaches.
Paper introduces method to make neural networks symmetrical.
problem Creating symmetrical neural networks for data with inherent symmetries.
method Introduces a method for modifying neural networks to enforce equivariance.
result Group convolutional neural networks are a special case of the introduced framework.
Deep networks better approximate functions with compositional structure.
problem Approximating functions with complex structures.
method Design deep networks with compositional structure, leveraging the blessing of compositionality.
result Deep networks can approximate functions better than shallow networks when the function has a compositional structure.
Secret neural networks hidden within trained models.
problem Excess capacity in neural networks allows embedding secret models.
method Novel framework for hiding secret neural networks within carrier networks.
result Detection of hidden networks is computationally infeasible.
GCNs adapted for road networks improve performance on edge prediction tasks.
problem Improving machine learning on road networks for edge prediction tasks.
method Introducing Relational Fusion Network (RFN) for road networks.
result RFN outperforms state-of-the-art GCNs on road segment regression and classification tasks.