Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

4079119158 · Jun 202019922001200920172026
48 results for transition densities

Proposes a method for approximating transition densities of SDEs driven by gamma processes.

problem Calculating transition densities for SDEs driven by gamma processes.
method Taylor-type approximation and conditional expectation of multiple stochastic integrals.
result Efficiency of the proposed method demonstrated through numerical tests.

FourNet approximates financial transition densities using Fourier transforms.

problem Approximating transition densities in finance with high accuracy.
method FourNet is a novel FFNN with Gaussian activation, learning from characteristic functions.
result FourNet can approximate transition densities arbitrarily well with finite neurons.

We introduce closed-form transition density expansions for multivariate affine jump-diffusion processes. The expansions rely on a general approximation theory which we develop in weighted Hilbert spaces for random variables which possess all polynomial moments. We establish parametric conditions which guarantee existen…

2011-04-28abs ↗pdf ↗

New findings confirm parallels to De Giorgi's conjecture for phase transitions in higher dimensions.

problem Understanding phase transitions with bounded index in higher-dimensional spaces.
method Establishing parallels to De Giorgi's conjecture for general solutions of bounded Morse index.
result Finite index solutions to the Allen--Cahn equation in R4\mathbb{R}^4 are one-dimensional, and this holds for all 4n74 \leq n \leq 7.

New models for short rates show longer periods at higher rates.

problem Modeling longer periods of higher interest rates.
method Developed a class of time-homogeneous one-factor Markov diffusion models with specific boundary conditions.
result Explicit expressions for bond prices and transition densities in new probability measure.

We consider a defaultable asset whose risk-neutral pricing dynamics are described by an exponential Levy-type martingale subject to default. This class of models allows for local volatility, local default intensity, and a locally dependent Levy measure. Generalizing and extending the novel adjoint expansion technique o…

2013-12-27abs ↗pdf ↗

We show that a surface group contained in a reductive real algebraic group can be deformed to become Zariski dense, unless its Zariski closure acts transitively on a Hermitian symmetric space of tube type. This is a kind of converse to a rigidity result of Burger, Iozzi and Wienhard.

2010-09-12abs ↗pdf ↗

The paper introduces new estimators for multivariate functions using Fourier methods.

problem Estimating multivariate functions like densities and regression functions.
method Monte Carlo estimators based on the Fourier integral theorem.
result Established rates of convergence for new estimators, often superior to existing methods.

Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.

problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density

Fold maps associated to geodesic random walks on curved spaces.

problem Understanding the behavior of geodesic random walks on curved surfaces.
method Analyzing mappings from the unit tangent sphere to a manifold with non-positive curvature.
result For odd powers of the unit tangent sphere, these mappings are fold maps.

Study phase transitions in noisy transformer dynamics on spheres.

problem Understanding phase transitions in noisy transformer dynamics on spheres.
method Sharp Beckner--Onofri/logarithmic HLS inequality, Funk--Hecke/Bessel coefficients, degree-two quartic obstruction.
result Sharp global-minimizer dichotomy and phase transitions in noisy transformer dynamics in arbitrary dimension.

New study shows low-degree polynomial algorithms struggle at clause densities close to Fix's.

problem Finding satisfying assignments in random k-SAT formulas at high clause densities.
method Analysis of low-degree polynomial algorithms and a new many-way overlap gap property.
result No efficient algorithms can find satisfying assignments at clause densities close to Fix's.

Paper proposes a new approach to optimal transport for vector and matrix densities.

problem Optimal transport for vector and matrix densities with positivity and action transitivity constraints.
method Gauge-theoretic approach using semi-direct product groups of diffeomorphisms and gauge transformations.
result Bures-type metrics on semi-direct product groups relate to Wasserstein-type metrics on vector and matrix densities via Riemannian submersions.

Graph diffusion processes approximate manifold heat semigroups using graph transition matrices.

problem Approximating manifold heat semigroups from graph data under low regularity conditions.
method Iterating graph transition matrix PP to approximate Qt=etΔQ_t = e^{tΔ}, bounding error in \infty-norm.
result Convergence rates O(N2/(d+6))O(N^{-2/(d+6)}) for manifold heat semigroup approximation, valid for in-sample and out-of-sample.

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the dat…

2012-10-19abs ↗pdf ↗

We study optimal estimation for sparse principal component analysis when the number of non-zero elements is small but on the same order as the dimension of the data. We employ approximate message passing (AMP) algorithm and its state evolution to analyze what is the information theoretically minimal mean-squared error …

2015-03-01abs ↗pdf ↗

This work explores efficient reinforcement learning with density features in low-rank MDPs.

problem Efficient reinforcement learning with density features in low-rank MDPs.
method Proposes algorithms for off-policy estimation and online construction of exploratory data distributions.
result Demonstrates sample-efficient learning with density features in low-rank MDPs, overcoming technical challenges.

The Sinkhorn-Knopp algorithm converges quickly but the number of iterations is poorly understood.

problem Understanding the number of iterations required for the Sinkhorn-Knopp algorithm to converge.
method Analyzing the Sinkhorn-Knopp algorithm for matrices with a specific density threshold.
result The Sinkhorn-Knopp algorithm requires Ω(n1/2/ε)Ω(n^{1/2}/\varepsilon) iterations for matrices with density γ<1/2γ<1/2.

We study the phase transition of dynamical herd behaviors for the yen-dollar exchange rate in the Japanese financial market. It is obtained that the probability distribution of returns satisfies the power-law behavior with three different values of the scaling exponent 3.11 (one time lag ττ = 1 minute), 2.81 (30 minut…

2004-08-28abs ↗pdf ↗

Machine learning predicts critical points for directed percolation models.

problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.

This paper gives a brief overview on the nonparametric techniques that are useful for financial econometric problems. The problems include estimation and inferences of instantaneous returns and volatility functions of time-homogeneous and time-dependent diffusion processes, and estimation of transition densities and st…

2004-11-01abs ↗pdf ↗

Generative Stochastic Networks (GSNs) have been recently introduced as an alternative to traditional probabilistic modeling: instead of parametrizing the data distribution directly, one parametrizes a transition operator for a Markov chain whose stationary distribution is an estimator of the data generating distributio…

2013-12-19abs ↗pdf ↗

We reprove a result concerning certain ruin in the classical problem of the probability of ruin with risky investments and several of it's generalisations. We also provide the combined transition density of the risk and investment processes in the diffusion case.

2005-06-08abs ↗pdf ↗

Study chaotic behavior in homeomorphism groups of countable products of spaces.

problem Investigate chaotic behavior in homeomorphism groups of countable products of various metrizable topological spaces.
method Construct numerous examples of chaotic groups of homeomorphisms of countable products of spaces.
result New chaotic groups of homeomorphisms of countable products of various metrizable topological spaces are discovered.

In the present paper, an expansion of the transition density of Hyperbolic Brownian motion with drift is given, which is potentially useful for pricing and hedging of options under stochastic volatility models. We work on a condition on the drift which dramatically simplifies the proof.

2017-05-02abs ↗pdf ↗

New insights into binary perceptron reveal phase transitions and algorithmic thresholds.

problem Understanding the statistical-computational gap in binary perceptron models.
method Application of fully lifted random duality theory (fl RDT) to uncover structural changes.
result Numerical estimates of constraint density thresholds align with theoretical predictions.

Hierarchical nucleation patterns emerge in deep neural network layers.

problem Understanding the generation of meaningful representations in deep neural networks.
method Analysis of the probability density of ImageNet dataset across hidden layers.
result Density peaks in subsequent layers mirror the semantic hierarchy of concepts, resembling nucleation process.

New method calibrates stochastic reduced-order models from data efficiently.

problem Challenges in estimating drift and diffusion coefficients from data for high-dimensional systems.
method Uses a novel relationship between conditional score and transition density to constrain model coefficients directly from finite-lag statistics.
result Validated on various systems, the method reproduces statistical and dynamical properties of the original models.

A new method uses deep learning to efficiently sample rare transitions for estimating committor functions.

problem Efficiently sampling rare transitions to estimate committor functions in high-dimensional problems.
method DASTR (Deep Adaptive Sampling on Transition Paths) method using deep generative models.
result Significantly improved accuracy in approximating committor functions through efficient sampling.

Develops diffusion models for time-varying correlation on the circle.

problem Time-varying correlation modeling on the circle.
method Stochastic processes on the unit circle, specifically Brownian motion and von Mises diffusion.
result Derives an accurate analytical approximation to the transition density of the von Mises diffusion.

Study shows zero level sets of solutions to Allen-Cahn equation are minimal surfaces with zero mean curvature.

problem Understanding phase transitions through entire solutions of the Allen-Cahn equation.
method Proving minimality of the zero level set with respect to a perimeter functional with density and showing zero mean curvature.
result The zero level set of entire solutions of the Allen-Cahn equation has zero mean curvature and is minimal.

Paper introduces TtT, market-implied transition time, from greenium term structure.

problem Estimating market-implied transition time to a low-carbon economy.
method Develops inference theory for TtT, introduces two stochastic models.
result Combines two-layer analysis for consistent estimation of diffusion parameters.

Generative Bayesian Filtering improves inference in complex models without explicit density evaluations.

problem Performing posterior inference in complex nonlinear and non-Gaussian state-space models.
method Generative Bayesian Filtering (GBF) extends GBC to dynamic settings using deep neural networks for recursive posterior inference. Generative-Gibbs sampler bypasses density evaluations for parameter learning.
result GBF significantly outperforms likelihood-free approaches in accuracy and robustness for intractable state-space models.

New method uses Hermite polynomials for American option valuation.

problem Valuation of American options with complex jump-diffusion dynamics.
method Hermite polynomial expansions of transition density and early exercise premium.
result Converging approximations to true option prices and exercise boundaries.