Fast Super-Paramagnetic Clustering

Lionel Yelibi; Tim Gebbie

doi:10.1016/j.physa.2019.124049

Home/Archive/arXiv

arXiv · 1810.02529

Fast Super-Paramagnetic Clustering

Lionel Yelibi·Tim Gebbie

View original source ↗Read source document ↗Export metadata ↓

Abstract

We map stock market interactions to spin models to recover their hierarchical structure using a simulated annealing based Super-Paramagnetic Clustering (SPC) algorithm. This is directly compared to a modified implementation of a maximum likelihood approach we call Fast Super-Paramagnetic Clustering (f-SPC). The methods are first applied standard toy test-case problems, and then to a data-set of 447 stocks traded on the New York Stock Exchange (NYSE) over 1249 days. The signal to noise ratio of stock market correlation matrices is briefly considered. Our result recover approximately clusters representative of standard economic sectors and mixed ones whose dynamics shine light on the adaptive nature of financial markets and raise concerns relating to the effectiveness of industry based static financial market classification in the world of real-time data analytics. A key result is that we show that f-SPC maximum likelihood solutions converge to ones found within the Super-Paramagnetic Phase where the entropy is maximum, and those solutions are qualitatively better for high dimensionality data-sets.

Explore related subjects

q-fin.CP stat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Lionel Yelibi, Tim Gebbie. 2019-06-20. Fast Super-Paramagnetic Clustering. https://doi.org/10.1016/j.physa.2019.124049

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Risk-Neutral Crash Frontier: Sharp Joint Bounds on Crash Probability and Conditional Depth from Option Bid-Ask Quotes

Index put prices are the market's quotes for crash insurance, and a put's value equals the probability of a crash times the expected shortfall given one. The market therefore prices the product of likelihood and depth, not the factors, and finitely many bid and ask quotes leave a range of ways to split it. Fitting one density hides that range, and bounds computed one factor at a time can combine into scenarios that no single risk-neutral distribution could produce. We characterize the set of probability and loss pairs that one distribution can generate while pricing every quote inside its spread, with depth as their ratio, and call its boundary the risk-neutral crash frontier. Partitioning the state space at the quoted strikes and the threshold, with one coordinate for mass at the threshold, makes the set the exact projection of a finite linear system, with no price grid. Linear programs trace the frontier and price any portfolio of digital and put payoffs sharply, each bound certified by a static super-replicating portfolio of cash, forward, and quoted options. In weekly SPX cross sections from 2013 to 2023, a median 37 percent of the scenarios that separate bounds admit are jointly infeasible. Extending the quote set from the eight strikes nearest the threshold to the complete put wing shrinks it by a further 5.4 to 18.2 percent.

q-fin.CP↗

arXiv2026

Simulation of stochastic volatility models via operator splitting schemes

The standard Euler discretization schemes for numerical option pricing under stochastic volatility models are known to exhibit high biases and potential unreliability. The alternative use of the exact (unbiased) simulation approach invariably involves numerical evaluation of integrated variance (and / or volatility) conditional on terminal variance (volatility) value. To resolve the technical challenge, most simulation schemes either employ the tedious Fourier inversion of conditional characteristic function or numerical approximation by moment matched distribution. We propose a general framework of constructing efficient and reliable simulation schemes for stochastic volatility models via the Strang operator splitting approximation. The simulation procedure completely circumvents the necessity of evaluation of conditional integrated variance (and / or) volatility. Our simulation schemes compete favorably well with most existing exact simulation schemes and the biased Euler schemes in terms of accuracy, efficiency, reliability and ease of implementation. Extensive numerical tests were conducted to illustrate the versatility and success of our operator splitting approach for most common stochastic volatility models, such as the Heston-type models, lifted Heston model, Hull-White model, and Barndorff-Nielsen and Shephard model. We also establish the proof of second-order convergence of the operator splitting schemes.

q-fin.CP↗

arXiv2026

Efficient simulation schemes for pricing options under the Ornstein--Uhlenbeck driven stochastic volatility model

We develop an efficient Monte Carlo simulation scheme for pricing options under the Ornstein-Uhlenbeck driven stochastic volatility model via the operator splitting approach. With an ingenious splitting of the governing stochastic differential equations, our operator splitting scheme admits analytic solutions in all sub-steps, so its implementation is simplified to require simulation of a few normal variates. This resolves the two typical numerical challenges in other simulation schemes, namely, sampling of conditional integrated variance and pathwise inverse integral transform of characteristic functions. There are three pioneering simulation schemes that attempt to overcome the above two numerical challenges. These include the Hilbert interpolation scheme of Zeng et al. (2023), Karhunen-Lo`eve expansion scheme of Choi (2025) and moment matching scheme based on the Inverse Gaussian distribution of Brignone and Sgarra (2026). We performed numerical tests to compare accuracy-speed performance of pricing options using our operator splitting scheme with these three pioneering schemes. We found that our scheme competes favorably well in terms of accuracy-speed tradeoff among all these schemes, in particular for pricing path dependent options with a large number of monitoring instants. The performance of our scheme can be well enhanced by martingale-preserving control variates and variance reduction via conditioning.

q-fin.CP↗