Feynman Formula for Discrete-Time Quantum Walks

Journal of Statistical Physics · 2026-05-09

Abstract We explicitly connect (discrete-time) quantum walks on $$\mathbb {Z} $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Z</mml:mi> </mml:math> with a four-state Markov additive process via a Feynman-type formula (13). Using this representation, we derive a relation between the spectral decomposition of the Markov additive process and the limiting density of the homogeneous quantum walk. In addition, we consider a space-time rescaling of quantum walks, which leads to a system of quantum transport PDEs in continuous time and space with a phase interaction term. Our probabilistic representation for this type of PDE offers an efficient Monte Carlo computational technique.

Analysis of Multiscale Reinforcement Q-Learning Algorithms for Mean Field Control Games

Applied Mathematics & Optimization · 2026-02-06

Collective arbitrage and the value of cooperation

Finance and Stochastics · 2025-11-26

Catalan Numbers, Riccati Equations and Convergence

arXiv (Cornell University) · 2024-08-17

We analyze both finite and infinite systems of Riccati equations derived from stochastic differential games on infinite networks. We discuss a connection to the Catalan numbers and the convergence of the Catalan functions by Fourier transforms.

Deep Reinforcement Learning for Infinite Horizon Mean Field Problems in Continuous Spaces

Journal of Machine Learning · 2024-12-23 · 2 citations

We present the development and analysis of a reinforcement learning algorithm designed to solve continuous-space mean field game (MFG) and mean field control (MFC) problems in a unified manner. The proposed approach pairs the actor-critic (AC) paradigm with a representation of the mean field distribution via a parameterized score function, which can be efficiently updated in an online fashion, and uses Langevin dynamics to obtain samples from the resulting distribution. The AC agent and the score function are updated iteratively to converge, either to the MFG equilibrium or the MFC optimum for a given mean field problem, depending on the choice of learning rates. A straightforward modification of the algorithm allows us to solve mixed mean field control games. The performance of our algorithm is evaluated using linear-quadratic benchmarks in the asymptotic infinite horizon framework.

Analysis of Multiscale Reinforcement Q-Learning Algorithms for Mean Field Control Games

arXiv (Cornell University) · 2024-05-27

Mean Field Control Games (MFCG), introduced in [Angiuli et al., 2022a], represent competitive games between a large number of large collaborative groups of agents in the infinite limit of number and size of groups. In this paper, we prove the convergence of a three-timescale Reinforcement Q-Learning (RL) algorithm to solve MFCG in a model-free approach from the point of view of representative agents. Our analysis uses a Q-table for finite state and action spaces updated at each discrete time-step over an infinite horizon. In [Angiuli et al., 2023], we proved convergence of two-timescale algorithms for MFG and MFC separately highlighting the need to follow multiple population distributions in the MFC case. Here, we integrate this feature for MFCG as well as three rates of update decreasing to zero in the proper ratios. Our technique of proof uses a generalization to three timescales of the two-timescale analysis in [Borkar, 1997]. We give a simple example satisfying the various hypothesis made in the proof of convergence and illustrating the performance of the algorithm.

Multivariate systemic risk measures and computation by deep learning algorithms

Quantitative Finance · 2023-07-26 · 4 citations

In this work, we propose deep learning-based algorithms for the computation of systemic shortfall risk measures defined via multivariate utility functions. We discuss the key related theoretical aspects, with a particular focus on the fairness properties of primal optima and associated risk allocations. The algorithms we provide allow for learning primal optimizers, optima for the dual representation and corresponding fair risk allocations. We test our algorithms by comparison to a benchmark model, based on a paired exponential utility function, for which we can provide explicit formulas. We also show evidence of convergence in a case in which explicit formulas are not available.

Multivariate Systemic Risk Measures and Computation by Deep Learning Algorithms

arXiv (Cornell University) · 2023-02-02

In this work we propose deep learning-based algorithms for the computation of systemic shortfall risk measures defined via multivariate utility functions. We discuss the key related theoretical aspects, with a particular focus on the fairness properties of primal optima and associated risk allocations. The algorithms we provide allow for learning primal optimizers, optima for the dual representation and corresponding fair risk allocations. We test our algorithms by comparison to a benchmark model, based on a paired exponential utility function, for which we can provide explicit formulas. We also show evidence of convergence in a case for which explicit formulas are not available.

Optimal investment with correlated stochastic volatility factors

Mathematical Finance · 2023-01-10 · 1 citations

Abstract The problem of portfolio allocation in the context of stocks evolving in random environments, that is with volatility and returns depending on random factors, has attracted a lot of attention. The problem of maximizing a power utility at a terminal time with only one random factor can be linearized thanks to a classical distortion transformation. In the present paper, we address the situation with several factors using a perturbation technique around the case where these factors are perfectly correlated reducing the problem to the case with a single factor. Our proposed approximation requires to solve numerically two linear equations in lower dimension instead of a fully nonlinear HJB equation. A rigorous accuracy result is derived by constructing sub‐ and super‐solutions so that their difference is at the desired order of accuracy. We illustrate our result with a particular model for which we have explicit formulas for the approximation. In order to keep the notations as explicit as possible, we treat the case with one stock and two factors and we describe an extension to the case with two stocks and two factors.

Collective Arbitrage and the Value of Cooperation

arXiv (Cornell University) · 2023-06-20

We introduce the notions of Collective Arbitrage and of Collective Super-replication in a discrete-time setting where agents are investing in their markets and are allowed to cooperate through exchanges. We accordingly establish versions of the fundamental theorem of asset pricing and of the pricing-hedging duality. A reduction of the price interval of the contingent claims can be obtained by applying the collective super-replication price.