A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Signature volatility models are analyzed for existence, arbitrage, completeness, and hedging-error decomposition.
problem Existence, arbitrage, completeness, and hedging-error decomposition of signature volatility models.
method Global existence and uniqueness of strong solutions, asset-pricing, market completeness, and hedging-error decomposition derived through structural results.
result Signature volatility models are structurally sound with existence, arbitrage, completeness, and hedging-error decomposition.
We compute the average Tristram---Levine signature of any graph link with positive weights in a three sphere, generalizing the results of Kirby and Melvin. The main tools are the Neumann's algorithm for computing the equivariant signatures of graph links and the Reciprocity Law for Dedekind sums.
Reconstructing signature features from randomized vector fields in differential equations.
problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.
We give manifolds in both the Riemannian and in the higher signature settings whose Riemann curvature operators commute, i.e. which satisfy R(a,b)R(c,d)=R(c,d)R(a,b) for all tangent vectors. These manifolds have global geometric phenomena which are quite different for higher signature manifolds than they are for Rieman…
Researchers develop Malliavin calculus for signatures, simplifying option Greeks computation.
problem Lack of tractability and explicit representations in Malliavin calculus.
method Focus on finite linear combinations of time-extended Brownian motion signatures, derive explicit formulas for Malliavin derivative, and compute Greeks for path-dependent options.
result Closed-form expressions for classical operators of Malliavin calculus, providing algebraic formulations.
We introduce a covariance matrix estimator that both takes into account the heteroskedasticity of financial returns (by using an exponentially weighted moving average) and reduces the effective dimensionality of the estimation (and hence measurement noise) via techniques borrowed from random matrix theory. We calculate…
It is well known that the classification of the Weyl tensor in Lorentzian manifolds of dimension four, the so called Petrov classification, was a great tool to the development of general relativity. Using the bivector approach it is shown in this article a classification for the Weyl tensor in all four-dimensional mani…
We improve deep threshold networks' memorization capacity exponentially.
problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O(δ1+n) neurons and O(δd+n) weights are sufficient.
Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but injective exponential maps. A generalization of the thickness formula is obtaine…
We propose an explicit recursive method to approximate a power-law with a finite sum of weighted exponentials. Applications to moving averages with long memory are discussed in relationship with stochastic volatility models.
A checkerboard graph of a special diagram of an oriented link is made a directed, edge-weighted graph in a natural way so that a principal minor of its Laplacian matrix is a Seifert matrix of the link. Doubling and weighting the edges of the graph produces a second Laplacian matrix such that a principal minor is an Ale…
Let φ∈C∞(Cn) be a given real valued function. We assume that $\pr\ddbarφ$ is non-degenerate of constant signature (n−,n+) on Cn. When q=n−, it is well-known that the Bergman kernel for (0,q) forms with respect to the k-th weight e−2kφ, k>0, admits a full asymptotic expansi…