Published July 19, 2026 | Version 2.0

Deterministic Log-CF Evaluation for Correlated Lognormal Sums

Authors/Creators

  • 1. Independent Researcher

Description

The moment-based Latent representation of correlated lognormal sums (Nagy, 2026, The Exact Latent Distribution of Correlated Lognormal Sums) relies on scaled moments c_k = m_k/k! whose logarithms grow quadratically in k in non-degenerate positive-weight cases. This creates an extreme dynamic range in the Padé Toeplitz systems used by that implementation. The reported experiments become impractical for \sigma_{\max} > 0.8, but this paper does not prove a general condition-number asymptotic, an impossibility result, or an information-theoretic lower bound. The Smooth Latent Operator (Nagy, 2026, The Smooth Latent Operator: Parameter-Free Distributional Representations via Kernel Moment Recovery) mitigates the observed instability through regularization without eliminating it in the reported high-volatility cases. We show that the moment-based route expands an unsuitable formal generating function. The moments are the formal Taylor coefficients associated with M(z)=E[e^{zS}], which is infinite for positive real z in the non-degenerate lognormal setting and has zero Taylor radius at the origin. By contrast, the Hermite-chaos expansion — the Wiener polynomial chaos of S in the underlying Gaussian variables — uses coefficients that decay factorially. This occurs because the exponential function e^{Y} has a convergent Hermite series for Y \sim N(\mu, \sigma^2), with coefficients \sigma^k/k!. The resulting Hermite Latent \Lambda^H = \{c_\mathbf{k}^H\} lives in \ell^2 (no Gaussian weight is needed). The characteristic function is represented by a convergent inner product (no Padé resummation needed). The CDF can then be approximated by Fourier-cosine inversion (Fang and Oosterlee, 2008). The numerical conditioning and accuracy of the full evaluator are assessed here only in the reported test regimes. We interpret this as a grade-3 Latent: a representation choice guided by the problem's structure. For lognormal sums, the Hermite-chaos basis is a natural candidate because it matches the underlying Gaussian variables. This is a problem-specific motivation, not a universal basis-selection theorem. The exact CDF integral representation is determined by the finite generative latent (w, \mu, \Sigma) \in \mathbb{R}^{n(n+5)/2} for positive weights and positive-definite covariance. Its numerical evaluator uses Gauss-Hermite order, COS order, and a finite log-domain as explicit precision choices. The reported results motivate this route as a useful alternative to moment-based evaluation; rigorous parameter-selection and end-to-end convergence guarantees remain open.

Maturity: Draft. Target venue: Mathematical Finance / Annals of Applied Probability. Part of The Latent research program.

Related papers in this program: Rough Volatility, Universal.

Notes

Topic: fin_fenton_solved. Source: topics/fin_fenton_solved/paper.md. Status: Draft. Related topics: rough_volatility, universal.

Files

CHANGELOG.md

Files (337.3 kB)

Name Size Download all
md5:4fd2a4e8d1eb6d1208e41c7324109a5a
2.8 kB Preview Download
md5:355f13b15643de46d4393fdb03a07f9c
101.3 kB Preview Download
md5:c8d8573314658be152f99f248b44fe11
233.3 kB Preview Download

Additional details

References

  • Nagy, T. (2026). The Latent: Finite Sufficient Representations of Smooth Systems. Zenodo. DOI: 10.5281/zenodo.19101209
  • Nagy, T. (2026). The Exact Latent Distribution of Correlated Lognormal Sums. Working paper.
  • Nagy, T. (2026). The Smooth Latent Operator: Parameter-Free Distributional Representations via Kernel Moment Recovery. Working paper.
  • Nagy, T. (2026). The Exact Latent Solution of the Gravitational Three-Body Problem. Zenodo. DOI: 10.5281/zenodo.19101229
  • Cameron, R.H. and Martin, W.T. (1947). The orthogonal development of non-linear functionals in series of Fourier-Hermite functionals. Annals of Mathematics, 48(2), 385–392. DOI: 10.2307/1969178
  • Wiener, N. (1938). The homogeneous chaos. American Journal of Mathematics, 60(4), 897–936. DOI: 10.2307/2371268
  • Xiu, D. and Karniadakis, G.E. (2002). The Wiener–Askey polynomial chaos for stochastic differential equations. SIAM Journal on Scientific Computing, 24(2), 619–644. DOI: 10.1137/S1064827501387826
  • Baker, G.A. and Graves-Morris, P. (1996). Padé Approximants. Cambridge University Press.
  • Gonnet, P., Güttel, S., and Trefethen, L.N. (2013). Robust Padé approximation via SVD. SIAM Review, 55(1), 101–117. DOI: 10.1137/110853236
  • Ernst, O.G., Mugler, A., Starkloff, H.J., and Ullmann, E. (2012). On the convergence of generalized polynomial chaos expansions. ESAIM: Mathematical Modelling and Numerical Analysis, 46(2), 317–339. DOI: 10.1051/m2an/2011045
  • Nobile, F., Tempone, R., and Webster, C.G. (2008). A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM Journal on Numerical Analysis, 46(5), 2309–2345. DOI: 10.1137/060663660
  • Fenton, L. F. (1960). The Sum of Log-Normal Probability Distributions in Scatter Transmission Systems. IRE Transactions on Communications Systems, CS-8, 57-67. DOI: 10.1109/tcom.1960.1097606
  • Gubner, J. A. (2006). A New Formula for Lognormal Characteristic Functions. IEEE Transactions on Vehicular Technology, 55(5), 1668–1671. DOI: 10.1109/tvt.2006.878610
  • Mehta, N. B., Wu, J., Molisch, A. F., and Zhang, J. (2007). Approximating a Sum of Random Variables with a Lognormal. IEEE Transactions on Wireless Communications, 6(7), 2690–2699. DOI: 10.1109/twc.2007.051000
  • Senaratne, D. and Tellambura, C. (2009). Numerical Computation of the Lognormal Sum Distribution. IEEE GLOBECOM 2009, 1–6. DOI: 10.1109/glocom.2009.5425708
  • Tellambura, C. and Senaratne, D. (2010). Accurate Computation of the MGF of the Lognormal Distribution and Its Application to Sum of Lognormals. IEEE Transactions on Communications, 58(5), 1568–1577. DOI: 10.1109/tcomm.2010.05.080640
  • Mahmoud, A. S. H. (2010). New Quadrature-Based Approximations for the Characteristic Function and the Distribution Function of Sums of Lognormal Random Variables. IEEE Transactions on Vehicular Technology, 59(7), 3364–3372. DOI: 10.1109/tvt.2010.2051467
  • Lo, C.-F. (2013). WKB Approximation for the Sum of Two Correlated Lognormal Random Variables. Applied Mathematical Sciences, 7, 6277–6289. DOI: 10.12988/ams.2013.39511
  • Berggren, F. (2024). Bounds and Approximations for the Distribution of a Sum of Lognormal Random Variables. arXiv:2405.09283. DOI: 10.48550/arXiv.2405.09283
  • Fang, Fang and Oosterlee, Cornelis W. (2008). A Novel Pricing Method for European Options Based on Fourier-Cosine Series Expansions. SIAM Journal on Scientific Computing, 31(2), 826-848. DOI: 10.1137/080718061
  • Imhof, J.P. (1961). Computing the distribution of quadratic forms in normal variables. Biometrika, 48(3/4), 419–426. DOI: 10.2307/2332763
  • Schwartz, S.C. and Yeh, Y.S. (1982). On the Distribution Function and Moments of Power Sums with Lognormal Components. Bell System Technical Journal, 61, 1441–1462. DOI: 10.1002/j.1538-7305.1982.tb04353.x
  • Liouville, J. (1835). Mémoire sur l'intégration d'une classe de fonctions transcendantes. Journal für die reine und angewandte Mathematik, 13, 93–118. DOI: 10.1515/crll.1835.13.93
  • Risch, R.H. (1969). The problem of integration in finite terms. Transactions of the American Mathematical Society, 139, 167–189. DOI: 10.1090/S0002-9947-1969-0237477-8
  • Nelson, E. (1973). The free Markoff field. Journal of Functional Analysis, 12(2), 211–227. DOI: 10.1016/0022-1236(73)90025-6
  • Favard, J. (1935). Sur les polynômes de Tchebicheff. Comptes Rendus de l'Académie des Sciences, 200, 2052–2053.
  • Abramowitz, M. and Stegun, I.A. (1964). Handbook of Mathematical Functions. National Bureau of Standards.
  • Trefethen, L.N. (2013). Approximation Theory and Approximation Practice. SIAM. DOI: 10.1137/1.9781611975949
  • Gil-Pelaez, J. (1951). Note on the inversion theorem. Biometrika, 38(3/4), 481–482. DOI: 10.1093/biomet/38.3-4.481