SearcharxivSearch

arXiv subjects

Pascal Oswald

Publications and source records attributed to Pascal Oswald.

4 recordsLinked to original sources

STN-GPR: A Singularity Tensor Network Framework for Efficient Option Pricing

We develop a tensor-network surrogate for option pricing, targeting large-scale portfolio revaluation problems arising in market risk management (e.g., VaR and Expected Shortfall computations). The method involves representing high-dimensional price surfaces in tensor-train (TT) form using TT-cross approximation, constructing the surrogate directly from black-box price evaluations without materializing the full training tensor. For inference, we use a Laplacian kernel and derive TT representations of the kernel matrix and its closed-form inverse in the noise-free setting, enabling TT-based Gaussian process regression without dense matrix factorization or iterative linear solves. We found that hyperparameter optimization consistently favors a large kernel length-scale and show that in this regime the GPR predictor reduces to multilinear interpolation for off-grid inputs; we also derive a low-rank TT representation for this limit. We evaluate the approach on five-asset basket options over an eight dimensional parameter space (asset spot levels, strike, interest rate, and time to maturity). For European geometric basket puts, the tensor surrogate achieves lower test error at shorter training times than standard GPR by scaling to substantially larger effective training sets. For American arithmetic basket puts trained on LSMC data, the surrogate exhibits more favorable scaling with training-set size while providing millisecond-level evaluation per query, with overall runtime dominated by data generation.

q-fin.PR

Ancestral lineages for a branching annihilating random walk

We study ancestral lineages of individuals of a stationary discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice $\mathbb{Z}^d$. Each individual produces a Poissonian number of offspring with mean $\mu$ which then jump independently to a uniformly chosen site with a fixed distance $R$ of their parent. By interpreting the ancestral lineage of such an individual as a random walk in a dynamical random environment, we obtain a law of large numbers and a functional central limit theorem for the ancestral lineage.

math.PR

Survival and complete convergence for a branching annihilating random walk

We study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $\mu$ which independently move to a uniformly chosen site within a fixed distance $R$ from their parent's position. Whenever a site is occupied by at least two particles, all the particles at that site are annihilated. We prove that for any $\mu>1$ the process survives when $R$ is sufficiently large. For fixed $R$ we show that the process dies out if $\mu$ is too small or too large. Furthermore, we exhibit an interval of $\mu$-values for which the process survives and possesses a unique non-trivial ergodic equilibrium for $R$ sufficiently large. We also prove complete convergence for that case.

math.PR

On the tightness of the maximum of branching Brownian motion in random environment

We consider one-dimensional branching Brownian motion in spatially random branching environment (BBMRE) and show that for almost every realisation of the environment, the distributions of the maximal particle of the BBMRE re-centred around its median are tight as time evolves. This result is in stark contrast to the fact that the transition fronts in the solution to the randomised Fisher--Kolmogorov--Petrovskii--Piskunov (F-KPP) equation are, in general, not bounded uniformly in time. In particular, this highlights that -- when compared to the settings of homogeneous branching Brownian motion and the F-KPP equation in a homogeneous environment -- the introduction of a random environment leads to a much more intricate behaviour.

math.PR