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,657 papers · 148 categories

Trend · papers per month

4385128170 · May 202619922001200920172026
48 results for chained equations

We study (backward) stochastic differential equations with noise coming from a finite state Markov chain. We show that, for the solutions of these equations to be `Markovian', in the sense that they are deterministic functions of the state of the underlying chain, the integrand must be of a specific form. This allows u…

2011-11-24abs ↗pdf ↗

We analyze a new Markov chain model for better sampling and optimization.

problem Developing a new Markov chain model for improved sampling and optimization.
method We introduce a new class of Ito chains with arbitrary noise and inexact drift/diffusion coefficients, proving a bound in W2W_{2}-distance.
result Our analysis provides improved or first results for various applications like SGLD, sampling, and boosting.

Simpler method derived for path geometries on surfaces, characterizing projective path geometries.

problem Characterizing projective path geometries on surfaces.
method Solving the equivalence problem of sub-Riemannian geometry of signature (1,1) on a contact 3-manifold.
result Characterization of projective path geometries in terms of their chains.

New method infers hidden states in continuous-time phenomena better than traditional models.

problem Traditional HSMM's are limited to discrete time grids and cannot handle irregularly spaced data.
method Formulated integro-differential forward and backward equations for CTSMC's, introduced scalable Viterbi-type algorithm.
result Efficiently solved equations for posterior marginals and path estimates.

Study on identifying AMP chain graph models under known and unknown component decompositions.

problem Identifying AMP chain graph models with known and unknown chain component decompositions.
method Analyzes conditions for identifiability of AMP models and proposes algorithms for structure recovery.
result Conditions for DAG identifiability in AMP models extend equal variance criteria for Bayes nets.

DCDC calculates convergence rates for Markov chains using neural networks.

problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.

The study extends GBM to include stable nonzero prices and finds a pronounced potential well.

problem The standard GBM model cannot describe stable nonzero prices in financial dynamics.
method Generalized GBM with polynomial drift of order q, model selection, and Markov chain Monte Carlo ensembles of potential functions.
result The optimal model for financial data is q=2, indicating the existence of a stable price.

Investor selects portfolios based on news attention in a hidden Markov model.

problem Mean-variance portfolio selection in a dynamic attention context.
method Closed-loop equilibrium strategies via extended HJB equation and Markov chain approximation.
result Equilibrium strategies found through iterative algorithm and numerical examples.

This research formalizes uncertainty quantification for Universal Differential Equations models.

problem Quantifying uncertainties in Universal Differential Equations models.
method Formalized uncertainty quantification methods for UDEs, including frequentist and Bayesian approaches.
result Evaluation of ensemble, variational inference, and MCMC sampling methods for UDEs.

The paper extends game theory using Hodge theory on graphs.

problem Generalizing Shapley's value allocation formula for cooperative games on graphs.
method Connecting stochastic path integrals to Hodge-theoretic Poisson's equations on graphs.
result The value allocation operator is the solution to Poisson's equation in combinatorial Hodge theory.

We introduce a combinatorial model based on measured foliations in surfaces which captures the phenomenology of open/closed string interactions. The predicted equations are derived in this model, and new equations can be discovered as well. In particular, several new equations together with known transformations genera…

2006-03-20abs ↗pdf ↗

In this paper, we study the asymptotics of the colored Jones polynomials of the Whitehead chains with one belt colored by M1M_1 and all the clasps colored by M2M_2 evaluated at the (N+1/2)(N+1/2)-th root of unity t=e2πiN+1/2t=e^{\frac{2πi}{N+1/2}}, where M1M_1 and M2M_2 are sequences of integers in NN. By considering the limiting r…

2019-12-23abs ↗pdf ↗

Review of sigma models on flag manifolds, linking to spin chains and integrable theories.

problem Understanding phase transitions and anomalies in spin chains and sigma models.
method Analyzing topological angles, discrete 't Hooft anomalies, and integrable models.
result Gapless phases in certain spin chains can be explained by discrete anomalies in continuum theories.

Study on convergence of SDEs using entropy methods.

problem Analyzing convergence of stochastic differential equations.
method Applied Lyapunov method to Fokker-Planck equation with weighted relative Fisher information.
result Exponential convergence of probability density function to invariant distribution in L1L_1 distance.

Optimizes consumption under regime-switching economic states with risk-sensitive preferences.

problem Optimizing consumption in an economy with uncertain states and random shocks.
method Risk-sensitive optimization of consumption-utility with a Markov chain model of economic states and i.i.d. random shocks.
result Existence of unique optimal policy and value function in stationary policies.

The study proves inequalities and curvature properties for Markov chains.

problem Isoperimetric and concentration inequalities for Markov chains.
method Laplacian separation principle for eikonal equation; modified log-Sobolev constant; Ollivier curvature.
result Affirmative answers to open questions and new inequalities.

Optimizes control of hybrid systems with multiple switching processes.

problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.

Dynamics of the major USA market indices DJIA, S&P, Nasdaq, and NYSE is analyzed from the point of view of the random walking problem with two-step correlations of the market moves. The parameters characterizing the stochastic dynamics are determined empirically from the historical quotes for the daily, weekly, and mon…

2001-12-16abs ↗pdf ↗

We solve the local equivalence problem for second order (smooth or analytic) ordinary differential equations. We do so by presenting a {\em complete convergent normal form} for this class of ODEs. The normal form is optimal in the sense that it is defined up to the automorphism group of the model (flat) ODE y"=0y"=0. For…

2016-11-25abs ↗pdf ↗

We introduce stochastic normalizing flows, an extension of continuous normalizing flows for maximum likelihood estimation and variational inference (VI) using stochastic differential equations (SDEs). Using the theory of rough paths, the underlying Brownian motion is treated as a latent variable and approximated, enabl…

2020-02-21abs ↗pdf ↗

Adaptive market maker curves minimize arbitrage losses in DeFi.

problem Asset trading prices in AMMs trail behind centralized exchanges, causing LP losses.
method Adapts market maker bonding curves to trader behavior using a differential equation derived from the Glosten-Milgrom model.
result Optimal adaptive curves minimize arbitrage losses while remaining competitive.

We study long wave limits for general Schrodinger maps systems into Kahler manifolds with a constraining potential vanishing on a Lagrangian submanifold. We obtain KdV type systems set on the tangent space of the submanifold. Our general theory is applied to study the long wave limit of the Gross-Pitaevskii equation, a…

2016-04-19abs ↗pdf ↗

Supply Chain Management often requires independent organizations to work together to achieve shared objectives. This collaboration is necessary when coordinated actions benefit the group more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relations…

2016-10-10abs ↗pdf ↗

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that 97% of proteins are, however, classified as unknots when intra-chain interaction…

2019-12-19abs ↗pdf ↗

DNFS trains efficient samplers for discrete distributions using locally equivariant Transformers.

problem Sampling from unnormalised discrete distributions.
method DNFS learns a rate matrix to satisfy the Kolmogorov equation, using control variates and locally equivariant Transformers.
result DNFS achieves efficient and effective sampling across various applications.

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of graphical models known as the structural equation model with latent variables. While …

2014-08-09abs ↗pdf ↗

In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by some causal structure. This corresponds to a family of graphical models known as the structural equation model with latent variables. While …

2010-02-25abs ↗pdf ↗