Regime-switching models, in particular Hidden Markov Models (HMMs) where the switching is driven by an unobservable Markov chain, are widely-used in financial applications, due to their tractability and good econometric properties. In this work we consider HMMs in continuous time with both constant and switching volati…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “continuous-time Markov chain”
Neural models learn continuous-time Markov chain transition rates from data.
problem Learning transition rates for complex stochastic systems.
method Neural networks to model nonlinear transition rates from observed data.
result Neural models outperform traditional methods in accuracy.
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.
We consider a Hidden Markov Model (HMM) where the integrated continuous-time Markov chain can be observed at discrete time points perturbed by a Brownian motion. The aim is to derive a filter for the underlying continuous-time Markov chain. The recursion formula for the discrete-time filter is easy to derive, however i…
Continuous time framework for discrete data denoising models.
problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.
Analysis of high-dimensional Continuous Time Markov Chains using the Local Bouncy Particle Samplerstat.ML
New algorithm speeds up sampling for complex statistical models.
problem Sampling parameters of high-dimensional CTMCs is challenging.
method Developed a local version of the Bouncy Particle Sampler (BPS) with exact event times.
result Algorithm achieves favorable computational efficiency for real-data scenarios.
New method resolves time order in genetic mutation models.
problem Underspecification in modeling genetic mutation time evolution.
method Continuous-time Markov chains with additional independent items.
result Additional items help determine time order and resolve underspecification.
Discrete-time weak approximation of a Black-Scholes model with drift and volatility Markov switchingmath.PR
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.
The article examines entropy-information inequalities for continuous-time Markov chains under curvature-dimension conditions.
problem Proving Li-Yau inequalities and modified logarithmic Sobolev inequalities for reversible Markov chains.
method Introducing the condition and deriving entropy-information inequalities.
result Derives functional inequalities relating entropy to Fisher information.
Introduces strong equilibrium for time-inconsistent stopping problems in continuous time.
problem Time-inconsistent stopping problems in continuous time.
method Introduces strong equilibrium, compares with existing mild and weak equilibria, and provides an iteration method to construct optimal mild equilibria.
result Optimal mild equilibria are always strong equilibria under certain conditions.
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserved paths in these models by introducing a fast auxiliary variable Gibbs sampler. Our approach is based on the idea of uniformization, and sets…
New method for fluid approximation of CTMCs without population structure.
problem Approximating the macro-scale behavior of large CTMCs.
method Spectral analysis of CTMC transition matrix, diffusion maps, Gaussian process regression.
result Construct an ODE approximating CTMC mean in continuous space.
In his 2011 work, Maas has shown that the law of any time-reversible continuous-time Markov chain with finite state space evolves like a gradient flow of the relative entropy with respect to its stationary distribution. In this work we show the converse to the above by showing that if the relative law of a Markov chain…
Efficiently infers coupled hidden Markov models with noisy discrete observations.
problem Intractable inference for coupled continuous-time Markov chains with discrete observations.
method Latent Interacting Particle Systems, look-ahead functions, twisted Sequential Monte Carlo sampling.
result Demonstrated effectiveness on latent SIRS model and wildfire spread dynamics.
New CTBNs with clocks allow for non-exponential survival times.
problem Modeling phenomena with non-exponential survival times in continuous time.
method Introduced node-wise clocks to construct graph-coupled semi-Markov chains, enabling non-exponential survival times without auxiliary states.
result Parameter and structure inference algorithms provided, demonstrating advantages over current CTBN extensions.
Unified framework for drawdown risk computation under Markov models.
problem High computational challenges in drawdown risk metrics.
method Unified framework for computing five drawdown quantities under general Markov models, using linear systems and efficient algorithms.
result Efficient algorithms achieve same complexity as path-independent problems, validated by rigorous convergence analysis and extensive experiments.
We consider the problem of estimating the transition rate matrix of a continuous-time Markov chain from a finite-duration realisation of this process. We approach this problem in an imprecise probabilistic framework, using a set of prior distributions on the unknown transition rate matrix. The resulting estimator is a …
Paper approximates rough stochastic local volatility models for efficient computation.
problem No unified method for rough stochastic local volatility models.
method Semimartingale and continuous-time Markov chain approximation.
result Fast CTMC algorithm with weak convergence proved.
Most previous contributions to BSDEs, and the related theories of nonlinear expectation and dynamic risk measures, have been in the framework of continuous time diffusions or jump diffusions. Using solutions of BSDEs on spaces related to finite state, continuous time Markov chains, we develop a theory of nonlinear expe…
New methods solve complex financial equations.
problem Solving backward stochastic differential equations driven by continuous-time Markov chains.
method Multi-stage Euler-Maruyama methods and multilevel spatial discretization.
result Efficiently solved stiff Markov BSDEs.
We approximate sticky diffusions using Markov chains for efficient simulation.
problem Approximating sticky diffusions for accurate simulation.
method CTMC approximation of sticky diffusions, efficient matrix exponentials, and Euler scheme comparison.
result Second order convergence of CTMC approximation for sticky diffusions.
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.
The paper studies how quickly samples from Langevin dynamics become independent.
problem Understanding the dependence between samples along Langevin dynamics and related algorithms.
method Measures dependence via -mutual information and proves strong data processing inequalities.
result The -mutual information between samples decreases exponentially to zero.
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given Markov model. We illustrate the method by implementing it for a range of models, incl…
Method calculates Parisian stopping times and option prices using Markov chains.
problem Computing distribution and pricing of Parisian stopping times under Markov processes.
method Continuous-time Markov chain approximation to solve for distribution and convergence analysis.
result Sharp convergence rate and efficient method for diffusion and jump models.
Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wassers…
We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure spaces. In order to apply to the discrete setting, the role of the Wasserstein metric…
A new sampler improves the inference of causal structures from observational data.
problem Inferring causal relationships from observational data when DAGs are Markov equivalent.
method Developed a non-reversible Markov chain, Causal Zig-Zag sampler, targeting Markov Equivalence Classes of DAGs.
result The sampler improves mixing and offers efficient algorithms for DAG inference.
Study optimal portfolios in a non-Markovian regime-switching model with random time horizon.
problem Optimal portfolio selection in a market with non-Markovian regime-switching and random time horizon.
method Formulated as a constrained stochastic linear-quadratic optimal control problem, derived closed-form expressions for optimal portfolios and efficient frontier.
result Closed-form expressions for optimal portfolios and efficient frontier derived under non-Markovian regime-switching and random time horizon.
The study establishes a curvature-dimension condition for discrete Markov chains.
problem Proving modified logarithmic Sobolev inequalities for discrete Markov chains.
method Identifying and proving a curvature-dimension inequality , and showing its compatibility with diffusive settings.
result The condition preserves curvature bounds under tensorization and leads to Beckner inequalities.
Method learns CTMC models from steady-state data, predicting unseen states.
problem Learning CTMC models from aggregate steady-state statistics without sequence examples.
method ∞-SGD, a stochastic gradient descent method that avoids infinite sums.
result Successfully learns CTMC models and predicts unseen states.
A new algorithm approximates optimal stopping problems with semi-tractable complexity.
problem Approximating the value of optimal stopping problems in discrete and continuous time.
method Weighted Stochastic Mesh (WSM) Algorithm for discrete and continuous time optimal stopping problems.
result WSM leads to semi-tractable complexity in discrete cases, with complexity bounded by .
New Markov chains defined on simplicial complexes for understanding their topology.
problem Understanding the topology of simplicial complexes and hypergraphs.
method Defining new Markov chains on simplicial complexes and studying their properties.
result The generator of the new Markov chain is the upper Laplacian, and the Markov chain is positive recurrent.
A key task in Bayesian statistics is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). However, without any assumptions, sampling (even approximately) can be #P-hard, and few works have provided "beyond worst-case" guarantees for such settings. For log-c…
This paper considers the problem of consumption and investment in a financial market within a continuous time stochastic economy. The investor exhibits a change in the discount rate. The investment opportunities are a stock and a riskless account. The market coefficients and discount factor switch according to a finite…
Study analyzes fees linked to VIX index in annuity contracts.
problem Impact of VIX-linked fees on annuity contract surrender strategies.
method Two-layer continuous-time Markov chain approximation for fund value process.
result Optimal surrender strategy is more robust to VIX-linked fees.
Efficient method for lookback option pricing under Markov models.
problem Pricing lookback options under Markov models.
method Model-free representations combined with numerical quadrature and Markov chain approximation.
result Efficient method applicable to various Markov models.
Cai, Song and Kou (2015) [Cai, N., Y. Song, S. Kou (2015) A general framework for pricing Asian options under Markov processes. Oper. Res. 63(3): 540-554] made a breakthrough by proposing a general framework for pricing both discretely and continuously monitored Asian options under one-dimensional Markov processes. In …
This paper investigates the pricing of European-style lookback options when the price dynamics of the underlying risky asset are assumed to follow a Markov-modulated Geo-metric Brownian motion; that is, the appreciation rate and the volatility of the underlying risky asset depend on unobservable states of the economy d…
Simulation of Multidimensional Diffusions with Sticky Boundaries via Markov Chain Approximationmath.PR
New method simulates sticky boundaries in multidimensional diffusions.
problem Simulating sticky boundaries in multidimensional diffusions.
method Approximate sticky diffusion by a Markov chain, using either finite difference or matching local moments.
result Validates both construction methods for first-order simulation schemes.
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.
We present two methodologies on the estimation of rating transition probabilities within Markov and non-Markov frameworks. We first estimate a continuous-time Markov chain using discrete (missing) data and derive a simpler expression for the Fisher information matrix, reducing the computational time needed for the Wald…
DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.
problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.
Study optimal investment and reinsurance for insurance companies in a dynamic market model.
problem Optimal investment and reinsurance strategies for insurance companies in a regime-switching market model.
method Forward dynamic exponential utility, value function construction, proportional reinsurance optimization.
result Characterization of optimal investment strategy and proportional reinsurance level.
We demonstrate that a number of sociology models for social network dynamics can be viewed as continuous time Bayesian networks (CTBNs). A sampling-based approximate inference method for CTBNs can be used as the basis of an expectation-maximization procedure that achieves better accuracy in estimating the parameters of…
We study theoretical and empirical aspects of the mean exit time of financial time series. The theoretical modeling is done within the framework of continuous time random walk. We empirically verify that the mean exit time follows a quadratic scaling law and it has associated a pre-factor which is specific to the analy…
Discrete Adjoint Matchingstat.ML
Proposes DAM for optimizing discrete generative models.
problem Challenges in optimizing discrete generative models.
method Discrete Adjoint Matching (DAM) for discrete state spaces.
result Demonstrates effectiveness on synthetic and mathematical reasoning tasks.
The paper models rating transitions and calibrates them to market data for XVA calculations.
problem Calibrating rating models to both historical and market data for accurate XVA calculations.
method Modeling rating transitions as a Markov chain, calibrating to historical and market data, proposing a novel calibration procedure.
result Improved XVA scheme through better calibration of rating models.