Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2404.00187

Portfolio management using graph centralities: Review and comparison

Bahar Arslan·Vanni Noferini·Spyridon Vrontos
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate an application of network centrality measures to portfolio optimization, by generalizing the method in [Pozzi, Di Matteo and Aste, \emph{Spread of risks across financial markets: better to invest in the peripheries}, Scientific Reports 3:1665, 2013], that however had significant limitations with respect to the state of the art in network theory. In this paper, we systematically compare many possible variants of the originally proposed method on S\&P 500 stocks. We use daily data from twenty-seven years as training set and their following year as test set. We thus select the best network-based methods according to different viewpoints including for instance the highest Sharpe Ratio and the highest expected return. We give emphasis in new centrality measures and we also conduct a thorough analysis, which reveals significantly stronger results compared to those with more traditional methods. According to our analysis, this graph-theoretical approach to investment can be used successfully by investors with different investment profiles leading to high risk-adjusted returns.

Explore related subjects

q-fin.PMmath.COq-fin.CP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bahar Arslan, Vanni Noferini, Spyridon Vrontos. 2024-03-29. Portfolio management using graph centralities: Review and comparison. https://arxiv.org/abs/2404.00187

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

KEEP EXPLORING

Related papers

arXiv2026

The geometry of higher order modern portfolio theory

In this article, we study the generalized modern portfolio theory, with utility functions admitting higher-order cumulants. We establish that under certain genericity conditions, the utility function has a constant number of complex critical points. We study the discriminant locus of complex critical points with multiplicity. Finally, we switch our attention to the generalization of the feasible portfolio set (variety), determine its dimension, and give a formula for its degree.

q-fin.PM↗
arXiv2026

Special Markowitz: Thermodynamic Formalism for the Joint Regularisation of Returns and Covariance

Special Markowitz (SM) regularises returns and covariance jointly, relative to a reference state (mu_ref, Sigma_ref). Each eigendirection of the whitened relative operator carries a signed spectral potential Phi_k, with persistence factor psi_k = exp(-Phi_k) > 0. Positive potentials attenuate empirical deviations from the reference geometry, zero potential preserves them, and negative potentials amplify them. The persistence factor psi_k governs both the return signal and the covariance deviation: the regularised deviation from the reference is psi_k times the empirical deviation. The logarithmic potential coordinate is characterised by a multiplicative composition law on the multiplicative group of positive real numbers; the Stein loss is characterised as the unique free-energy density (within a natural class) compatible with the resulting coupling. The SM pressure functional is additive across modes the defining property of Special Markowitz.

q-fin.PM↗
arXiv2026

Separated Signal Libraries: Packing, Saturation, and Joint Spectral Limits

We study libraries of cross-sectional signals: at each date, a forecast vector over $d$ assets intended to predict the next period's cross-sectional return. Demeaned and unit-normalized, a signal is a point on a sphere and its $T$-date history a point on a product of $T$ spheres. A pairwise correlation cap on histories is a minimum angular separation on that product, so growing a library under such a cap is a packing problem. If a large library is not too pairwise correlated and is equally weighted, does the equally weighted sum (EWS) tend to a known principal-component quantity as it grows? We answer this under explicit assumptions on how the library is filled. Separation alone guarantees nothing: it fixes no limiting distribution; a saturated library covers the sphere yet can carry a biased count; and near-maximum packing on a fixed domain forces uniform volume, which on the unrestricted sphere gives zero mean and no distinguished principal component (PC1). Alignment depends on the admission rule and candidate distribution. Under the uniform product-volume benchmark, screening on positive average information coefficient (IC) yields a nonzero, target-aligned mean but an isotropic second moment, whereas a positive IC margin $β$ makat every finite $T$, with athree-level spectrum whose leading eigenvalue tends to $β^2$ while residual levels decay as $1/T$; margins of order $T^{-1/2}$ keep a positive admission rate but a vanishing eigengA finite residual-spectrum criteS-PC1 alignment.Gilbert-Varshamov codes show separation permits both outcomes: exponentially large positive-IC libraries exist whose EWS is PC1, and others whose EWS is orthogonal to PC1. $\log J=o(T)$ suffices for uniform estimation among $J$ candidates from $T$ iid dates. Derived results are proved and checked numerically; no market data are used.

q-fin.PM↗