Relevance
8/10
Highly relevant to quantitative portfolio construction. The paper provides rigorous theoretical foundations for understanding why long-only minimum variance portfolios concentrate in a small subset of assets (those with lowest betas), which is critical for practical portfolio implementation. The explicit threshold characterization (Theorem 1) provides a computable O(log p) algorithm for determining the active set. The asymptotic results (Theorems 2-3) explain the concentration phenomenon in large universes and quantify how the active ratio depends on the distribution of betas. Directly applicable to index tracking, risk parity, and minimum variance portfolio construction under realistic long-only constraints.
Implementation Complexity
5/10
The core algorithm (Theorem 1) is computationally straightforward: compute the sequence {R_i} for ordered betas, find the sign change via bisection in O(log p) steps, then solve a k-dimensional linear system. The theoretical proofs are mathematically sophisticated (KKT conditions, Woodbury identity, SLLN, Glivenko-Cantelli, CLT, concavity arguments), but the practical implementation is simple. The asymptotic results require numerical integration to compute beta* from the integral equation G(y)=0. The simulation framework is standard Monte Carlo.
Reproducibility
4/5
The paper provides complete mathematical proofs for all theorems. Simulation code is available on GitHub (doi:10.5281/zenodo.19460320). The theoretical results are fully self-contained with explicit formulas. However, the paper is primarily theoretical, so reproducibility of the main results requires implementing the proofs rather than running experiments. The numerical examples are well-documented with specific parameter choices.