AIAndrey Itkin

Andrey Itkin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Andrey Itkin has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    DSINC Beyond Heston: The 3/2 and Other Non-affine Stochastic-Volatility Models

    by Andrey Itkin

    This paper extends the damped-sinc (DSINC) method for American options beyond the affine Heston class to general one-factor stochastic-volatility models. We show that the collapse identity, which reduces the early-exercise integral to a single spectral integral, remains valid for these models. Damping between zero and one is admissible whenever the discounted spot is a nonnegative local martingale. An Itô transformation of the volatility factorizes the conditional characteristic function and identifies a natural coordinate for approximating the exercise boundary. The 3/2 model admits closed-form joint transforms in terms of Kummer functions, while uncorrelated SABR admits a Bessel representation. When a practical closed-form transform is unavailable, the required volatility integral is computed directly by solving one backward equation per frequency, without a grid in the log-price. Through a known change of volatility coordinate, this approach also accommodates correlated SABR. Tests on the 3/2, SABR, GARCH and lognormal-volatility models show agreement with fine finite-difference benchmarks to within one basis point of the strike. Computational cost is comparable to or lower than that of our finite-difference implementation, except for the slower Hankel implementation of uncorrelated SABR.

  • Open Access

    A GLE-LSV Model with State-Dependent Leverage and Colored Noise

    by Andrey Itkin

    We study a local stochastic volatility (LSV) model in which the variance factor follows a generalized Langevin equation (GLE) with colored noise, and past returns act on variance through a memory kernel with state-dependent amplitudes. For kernels given by finite sums of exponentials, we prove existence, uniqueness, and nonexplosion under a growth condition linking the volatility map to the potential. In a one-mode family with a polynomial potential, feedback through log returns can cause explosion exactly when the squared volatility factor grows faster than the restoring force. Under structural and nondegeneracy conditions, an exact reduced Markovian state has a smooth density solving a deterministic forward equation. The Dupire conditional expectation therefore requires no stochastic partial differential equation. Under a bounded Sharpe ratio, exponential utility selects the minimal entropy martingale measure, whose premium solves a quadratic backward stochastic differential equation. Under a regularity hypothesis, which we verify in special cases with and without leverage, the premium depends only on the current state, and the squared VIX equals the expected average future local stochastic variance. Finally, a regularized calibration problem with bid-ask constraints admits a minimizer whenever a feasible point has finite objective value.

  • Open Access

    A Generalized Langevin Model of Latent Liquidity and Concave Price Impact

    by Andrey Itkin

    We model market impact as the response to submitted order flow net of counterflow from latent traders, activated when price displacements from the level that would prevail without the order exceed individual thresholds. Order flow depletes this pool, and a generalized Langevin equation governs its recovery over several time scales. Its memory kernels are finite sums of exponentials, so its Markovian lift is exact rather than an approximation. For an undepleted pool, aggregation under explicit assumptions on individual trading responses yields an intermediate square-root regime between linear smalland large-order limits, without imposing a square-root impact law. Scaling thresholds and responses with price noise makes impact in this regime proportional to volatility, and thresholds that grow with the execution horizon make it independent of duration. With constant displayed depth, expected round-trip costs are nonnegative under the log-price convention, independently of the memory. Numerical experiments show that depletion narrows the square-root range and that memory spectra producing similar single-order impacts can respond differently after substantial prior trading. Calibration to market data is left to a companion paper.

  • Open Access

    Diagonal Frog Meets ADI: Trading Matrix Exponentials for Rational Maps in the Fokker-Planck Equation

    by Andrey Itkin, Rakhymzhan Kazbek

    A companion paper [Itkin, 2026a] introduced the Diagonal Frog (DF) positivity-preserving schemes for anisotropic Fokker-Planck equations, advancing each directional substep by a Krylov-computed matrix exponential, which dominates the cost. Replacing that exponential by a rational map r(γL) reduces the substep to a banded solve, but the positivity argument no longer applies. We prove that for eventually exponentially positive generators the entrywise sign of r(γL) at large steps is decided by a single number, the value r(∞) taken on infinitely stiff modes. Nonnegativity holds above a computable threshold when 0 ≤ r(∞) < 1, and at most on a bounded interval, empty or vanishingly narrow in all our tests, when r(∞) < 0. The criterion rejects the Crank-Nicolson (trapezoidal) method, where r(∞) =-1, and selects the subdiagonal Padé(0, 2) method, which is second order, L-stable and provably positive above an explicit threshold. The resulting DF-ADI scheme costs O(N) per step, keeps the implicit factorized mixed derivative unchanged, is second order in space and time, and conserves discrete mass exactly. In the strong cross-diffusion regime, however, the directional factors demand a step larger than the mixed derivative permits, so the composite second-order scheme is only empirically positive there, and the criterion serves to discriminate the well-behaved multiplicative factors from the stabilizing-correction schemes rather than to guarantee positivity. Against the Krylov exponential it runs ten to thirty-two times faster at matched accuracy in our tests with the gain growing with the mesh. We extend the construction to the backward Kolmogorov equation and to jump-diffusion models.

  • Open Access

    Calibrating Inelastic Markets to Options: The Lean Marketron and the Generalized Langevin Equation

    by Andrey Itkin

    The Marketron model of [Halperin and Itkin, 2026] and its option pricing extension in [Halperin and Itkin, 2025] suffer from structural non-identifiability: an eighteenparameter space traps solvers in suboptimal local minima and renders economic quantities unmeasurable. By removing exact scaling gauges and sign symmetries, freezing non-financial parameters by explicit criteria, and adiabatically eliminating the fast hidden signal, we derive a robust nine-parameter reduced model. A Gauss-Newton Hessian with empty null space and a manifold-boundary analysis confirm that the reduced core carries no exact symmetry and admits no further reduction. A diffusive correlation between flow and return innovations captures the short-maturity skew. A staged calibration from the physical measure to the risk-neutral measure, illustrated on SPX options, fits the whole surface with a single parameter set. The same reduction turns the wedge between the physical and pricing values of the flow block into a well-defined market price of flow risk rather than a ridge artifact, identifiable here for the first time, though a single surface constrains its level only weakly. Finally, our analysis reveals that in the Marketron model the log-price obeys a generalized Langevin equation with a closed-form, state-modulated memory kernel, and that the memory variable itself is the exact Markovian lift of this kernel. This mapping also yields a testable condition, the equality of the signal and memory relaxation rates, which on the SPX surface come out well separated, though both weakly identified, placing the fitted market tentatively in the driven, non-equilibrium regime and turning the active-matter reading from an analogy into a falsifiable constraint.

  • Open Access

    Beyond Rough Volatility: Decoupling Memory and Scaling via a Generalized Langevin Equation

    by Andrey Itkin

    Borrowed from non-equilibrium statistical mechanics, the generalized Langevin equation (GLE) is imported as a framework for stochastic volatility to address the structural limitations of fractional Brownian motion (fBm), the standard engine of rough volatility. The fBm forces a single parameter to set two logically independent properties at once: how volatility scales and how it remembers. The GLE separates them using a memory kernel K, a potential U , and a noise covariance C. Memory becomes a measurable object, and an asymmetric potential supplies a lever on variance skew that the price-variance correlation cannot reach. Physical-measure tests on public datasets decisively reject two constrained corners of the class, a memoryless leverage effect and time-reversal symmetry, while the central rough scaling constraint is left identification-limited rather than refuted. The paper reports these limits honestly, and validation on industry-grade data remains a valuable direction. The risk-neutral construction and the joint SPX-VIX calibration will be developed in a companion paper.

  • Open Access

    Diagonal Frog: High-Order Positivity-Preserving FD Schemes for Anisotropic Fokker-Planck Equations from Financial Engineering to Active Matter

    by Andrey Itkin

    He Fokker-Planck equation is fundamental to statistical mechanics, yet in settings with multiple state variables, anisotropic (cross-) diffusion, and jumps, conventional discretizations frequently produce non-physical negative probability densities. Building on the operator approach of "A. Itkin, Pricing derivatives under Levy models. Modern finite difference and pseudo-differential operators approach, Springer, 2017, ISBN 978-1-4939-6792-6", we introduce a family of "Diagonal Frog" discretizations whose spatial operators are eventually M-matrices (EM-matrices). Although these operators lack a local M-matrix structure, positivity of the directional sub-operators emerges in the spirit of Zeno's paradox: the matrix exponential, assembled as the limit of infinitely many ever-smaller substeps, is provably nonnegative after a short transient even though no single substep is. For the mixed-derivative block, whose generator is not eventually nonnegative, positivity instead rests on a factorized resolvent solver and holds conditionally, on an explicit step-size window; discrete mass is conserved exactly by the splitting for every step size. The resulting schemes are second-order accurate in time and space and require O(m 2 N + m 3) operations per time step, where m is the dimension of the Krylov subspace used to apply the exponential. As stress tests, we solve a two-dimensional anisotropic Fokker-Planck equation in the strong cross-diffusion regime against an exact Gaussian reference, a Kramers escape problem in a double-well potential, and an advection-dominated problem, and observe that the schemes remain stable, nonnegative, and mass-conservative for a wide range of Pécklet numbers (so, don't need any flux limiter). Finally, we extend the construction to multidimensional processes and to the backward Kolmogorov equation with jumps.

  • Open Access

    Flux-corrected Diagonal Frog: Second Order and Positivity at All Time Steps

    by Andrey Itkin

    By Godunov's theorem, linear second-order finite-difference schemes for the Fokker-Planck equation cannot preserve positivity. The Diagonal Frog (DF) framework previously bypassed this barrier using eventual positivity, but required a strict minimum time step. This paper resolves the small-step limitation using a nonlinear extension of the DF solvers. We split the second-order directional operator into a monotone M-matrix core and an antidiffusive flux correction. A Zalesak-type limiter is then applied iteratively within the implicit banded solve. The resulting Flux-Corrected DF (FCDF) schemes (variants A and B) are unconditionally positive across all time steps. Because the limiter acts on fluxes rather than point values, these schemes conserve discrete mass exactly and maintain second-order accuracy. Crucially, the limiter activates only within unresolved layers. This ensures the global L 1 convergence remains second-order uniformly in the cell Péclet number, avoiding the first-order degradation seen in the Chang-Cooper scheme. The method's Picard iteration is contractive under a purely convective step restriction. To support arbitrary step sizes, we develop an active-set reformulation. This solves the system using a semismooth Newton iteration, where computational cost scales only with the number of nodes where positivity binds. Finally, we introduce a defect-corrected time stepping approach that restores second-order time accuracy. Numerical experiments on Ornstein-Uhlenbeck and advection-dominated benchmarks confirm our claims.

  • Open Access

    Valuing American options and Flexible Forwards contracts in time-dependent models

    by Leif B.G. Andersen, Andrey Itkin, Rakhymzhan Kazbek

    A flexible forward (FF) is a customized FX hedging instrument that guarantees a fixed exchange rate while letting the holder choose the delivery date within a pre-agreed window. It is therefore an American-style option on timing, and its valuation must respect the volatility skew of the underlying currency pair. We price FF contracts (and, more generally, American options) under a time-inhomogeneous Heston model which captures the forward-skew term structure while preserving analytical tractability through a recursive (matrix) Riccati solution for the joint characteristic function. Extending the integral-equation (decomposition) approach to time-dependent coefficients, we derive a Volterra equation characterizing the early-exercise surface. The expectation in the decomposition formula is evaluated by two complementary spectral methods: a double cosine (COS) expansion of the transition density, and a damped-Sinc (DSINC) local-basis scheme that is more accurate and stays robust when a low Feller ratio or large vol-of-vol induces Gibbs oscillations in the COS series. Benchmarked against a penalty-iteration MCS-ADI finite-difference solver, both methods price a contract in about 1-2 seconds, roughly an order of magnitude faster than the finest finite-difference grid, while DSINC improves median accuracy over COS by about a factor of twelve. The experiments also show that the early-exercise surface is a substantially nonlinear function of the variance, contrary to the linear-in-variance approximation common in earlier work.

  • Semi-Analytical Pricing of American Options with Hybrid Dividends via Integral Equations and the GIT Method

    by Andrey Itkin

    This article introduces a semianalytical method for pricing American options on assets (stocks, ETFs) that pay discrete or continuous dividends. The problem is notoriously complex because discrete dividends create abrupt price drops and affect the optimal exercise timing, making traditional continuous dividend models unsuitable. Our approach uses the Generalized Integral Transform (GIT) method introduced by the author and his co-authors in several previous publications, which transforms the pricing problem from a complex partial differential equation with a free boundary into an integral Volterra equation of the second or first kind. In this article, we illustrate this approach by considering a popular GBM model that accounts for discrete cash and proportional dividends using Dirac delta functions. By reframing the problem as an integral equation, we can sequentially solve for the option price and the early exercise boundary, effectively handling the discontinuities caused by the dividends. Our methodology provides a powerful alternative to standard numerical techniques such as binomial trees or finite difference methods, which can struggle with the jump conditions of discrete dividends by losing accuracy or performance. Several examples demonstrate that the GIT method is highly accurate and computationally efficient, avoiding the need for extensive computational grids or complex backward induction steps.