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

3527041,0561,408 · Jun 202019922001200920172026
48 results for discrete-time models

Study approximates financial market with discrete-time models.

problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.

Defines speculative bubbles in discrete-time models based on discounted stock price losing mass.

problem Characterizing speculative bubbles in discrete-time models.
method Introduces a new definition based on discounted stock price behavior and provides probabilistic characterizations.
result Speculative bubbles in discrete time are linked to solutions of a linear Volterra integral equation.

Study proves existence and convergence of discrete-time Kyle models with multiple insiders.

problem Existence and convergence of discrete-time Kyle models with multiple informed traders.
method Proves existence and convergence of discrete-time Kyle models with multiple informed traders using mathematical proofs.
result Equilibrium exists and converges to continuous-time equilibrium as the number of trading times increases.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

Paper develops a continuous-time framework for financial markets without stochastic calculus.

problem Developing continuous-time financial models without stochastic calculus.
method A general framework using conditional topologies and pseudo-distance topologies.
result No-arbitrage conditions hold in continuous time if and only if they hold in discrete time.

Study asset pricing under model uncertainty with discrete time and states.

problem Asset pricing under model uncertainty with discrete time and states.
method Novel definition of arbitrage, investigation of no-arbitrage conditions, expansion to multi-period securities model.
result Necessary and sufficient conditions for no-arbitrage asset pricing under model uncertainty.

Optimal strategy for liquidating portfolios under discrete time intervals.

problem Optimizing liquidation of portfolios with discrete time constraints and impact effects.
method Modeling portfolio liquidation with N risky assets, using VaR for cost measurement, and deriving an optimal liquidation time.
result The optimal liquidation time is only influenced by temporary price impacts, not permanent ones.

We present a new approach for studying the problem of optimal hedging of a European option in a finite and complete discrete-time market model. We consider partial hedging strategies that maximize the success probability or minimize the expected shortfall under a cost constraint and show that these problems can be trea…

2009-10-27abs ↗pdf ↗

We give a general formulation of the utility maximization problem under nondominated model uncertainty in discrete time and show that an optimal portfolio exists for any utility function that is bounded from above. In the unbounded case, integrability conditions are needed as nonexistence may arise even if the value fu…

2013-07-13abs ↗pdf ↗

Continuous time models in the theory of real options give explicit formulas for optimal exercise strategies when options are simple and the price of an underlying asset follows a geometric Brownian motion. This paper suggests a general, computationally simple approach to real options in discrete time. Explicit formulas…

2004-04-05abs ↗pdf ↗

This paper derives a diffusion approximation for a sequence of discrete-time one-sided limit order book models with non-linear state dependent order arrival and cancellation dynamics. The discrete time sequences are specified in terms of an R+\R_+-valued best bid price process and an Lloc2L^2_{loc}-valued volume process. …

2016-08-05abs ↗pdf ↗

The paper studies market viability and completeness in discrete markets.

problem Characterizing the set of equivalent martingale measures in finite markets.
method Characterization as convex combinations of martingale measures, algorithm for finding these measures.
result Limitations of using discrete-time models to understand continuous-time models.

Study bounds for European basket call options in a discrete-time market model with price jumps.

problem Bounding the prices of European basket call options in a market model with price jumps.
method Computed bounds using a binomial model and proved that the lower bound coincides with Jensen's bound.
result The upper bound of the price interval of European basket call options can be computed by restricting to a binomial model.

Paper introduces dynamic strategies for multi-period investment models.

problem Optimizing investment strategies over multiple periods with risk and return considerations.
method Developed a Bellman principle for discrete time multi-period mean-variance models, leading to dynamic optimal strategies and efficient frontiers.
result Dynamic optimal strategies can achieve higher returns with lower risk compared to the 1/n strategy.

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.

The paper analyzes the probabilistic structure of DDPMs and bounds their sampling error.

problem Understanding and controlling errors in discrete-time DDPMs.
method Structural analysis of score functions, Schrödinger's problem, and FBSDEs.
result Explicit upper bound for total variation distance between sampling and target distributions.

We introduce a setup of model uncertainty in discrete time. In this setup we derive dual expressions for the super--replication prices of game options with upper semicontinuous payoffs. We show that the super--replication price is equal to the supremum over a special (non dominated) set of martingale measures, of the c…

2013-04-12abs ↗pdf ↗

Building on the work of Schweizer (1995) and Cern and Kallseny (2007), we present discrete time formulas minimizing the mean square hedging error for multidimensional assets. In particular, we give explicit formulas when a regime-switching random walk or a GARCH-type process is utilized to model the returns. Monte Carl…

2012-11-21abs ↗pdf ↗

We develop theory and applications of forward characteristic processes in discrete time following a seminal paper of Jan Kallsen and Paul Krühner. Particular emphasis is placed on the dynamics of volatility surfaces which can be easily formulated and implemented from the chosen discrete point of view. In mathematical t…

2014-09-05abs ↗pdf ↗

We study the superreplication of contingent claims under model uncertainty in discrete time. We show that optimal superreplicating strategies exist in a general measure-theoretic setting; moreover, we characterize the minimal superreplication price as the supremum over all continuous linear pricing functionals on a sui…

2013-01-15abs ↗pdf ↗

This note develops an arbitrage theory for a discrete-time market model without the assumption of the existence of a numéraire asset. Fundamental theorems of asset pricing are stated and proven in this context. The distinction between the notions of investment-consumption arbitrage and pure-investment arbitrage provide…

2014-10-11abs ↗pdf ↗

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

We study a robust stochastic optimization problem in the quasi-sure setting in discrete-time. We show that under a lineality-type condition the problem admits a maximizer. This condition is implied by the no-arbitrage condition in models of financial markets. As a corollary, we obtain existence of an utility maximizer …

2016-10-28abs ↗pdf ↗

Optimizes control of noisy discrete systems without system matrix knowledge.

problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.

Kyle's equilibrium model stability proven for 1-2 trading times, but not for 3 or more.

problem Stability of Kyle's equilibrium model in a dynamic trading setting.
method Proof of stability for 1-2 trading times, non-stability for 3 or more trading times, independent of input parameters.
result Kyle's equilibrium model is stable for 1-2 trading times but not for 3 or more trading times.

Paper formulates mutual information optimal control for discrete-time systems.

problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.