Novel Data Driven High Dimensional Volatility Networks and Dynamic Price Networks
Bibliographic record
Abstract
This study investigates data-driven financial correlation networks with a particular focus on modeling log returns using a data-driven t-distribution. A key contribution is showing that the covariance matrix of absolute log returns, used in volatility networks can be expressed as a function of the sign correlation and the covariance matrix of log returns. Fuzzy adjacency matrices are introduced to account for the uncertainty inherent in correlation estimates that depend on the degrees of freedom. Using data from 55 stocks across 13 sectors and S&P500 (big data), we compare four different networks based on correlations of log returns, volatility of log returns, data-driven volatility of log returns and sign(±) of returns. Three dynamic networks based on price correlations, ARIMA innovation correlations of the price and neuro innovation correlations of the price are also considered. All seven networks are evaluated using metrics such as average node degree, sparsity, and maximum eigenvalue. Unlike the existing work, the novelty of this study is demonstrating a relationship between data driven volatility networks and recently proposed volatility correlation networks without using distributional properties. Three different community detection algorithms demonstrate that the proposed data-driven volatility network proposed in this paper has a higher modularity score.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".