ACAlexander Matthew Gordon Cox

Alexander Matthew Gordon Cox

*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


Alexander Matthew Gordon Cox has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Utility Maximisation with Model-independent Constraints

    by Alexander M. G. Cox, Daniel Hernandez-Hernandez

    We consider an agent who has access to a financial market, including derivative contracts, who looks to maximise her utility. Whilst the agent looks to maximise utility over one probability measure, or class of probability measures, she must also ensure that the mark-to-market value of her portfolio remains above a given threshold. When the mark-to-market value is based on a more pessimistic valuation method, such as model-independent bounds, we recover a novel optimisation problem for the agent where the agents investment problem must satisfy a pathwise constraint. For complete markets, the expression of the optimal terminal wealth is given, using the max-plus decomposition for supermartingales. Moreover, for the Black-Scholes-Merton model the explicit form of the process involved in such decomposition is obtained, and we are able to investigate numerically optimal portfolios in the presence of options which are mispriced according to the agent's beliefs.

  • Binary branching processes with Moran type interactions

    by Alexander M. G. Cox, Emma Horton, Denis Villemonais

    L’objectif de cet article est d’étudier la limite en grande population d’une nouvelle famille de systèmes de particules en interaction (IPS) qui englobe les modèles de branchement et les IPS de type Moran de taille fixe (voir (J. Phys. A 29 (1996) 2633–2642) ; (Comm. Math. Phys. 214 (2000) 679–703) ; (Feynman–Kac Formulae : Genealogical and Interacting Particle Systems with Applications (2004) Springer-Verlag) ; (Mean Field Simulation for Monte Carlo Integration (2013) CRC Press) ; (ESAIM Probab. Stat. 18 (2014) 441–467)). Nous définissons un IPS où les particules évoluent, se reproduisent et meurent indépendamment et, avec une probabilité qui peut dépendre de la configuration du système entier, la mort d’une particule peut déclencher la reproduction d’une autre particule, tandis qu’un événement de branchement peut déclencher la mort d’une autre particule. Nous étudions la mesure d’occupation du nouveau modèle, en la reliant explicitement au semigroupe de Feynman–Kac de l’évolution markovienne sous-jacente et en quantifiant la distance L2 entre leurs normalisations. Nous montrons que notre modèle est plus performant que l’IPS de Moran de taille fixe lorsqu’il est utilisé pour approximer un processus de naissance et mort. Nous discutons de plusieurs autres applications de notre modèle, notamment l’équation de transport des neutrons (Cox et al. (2020) ; Stochastic Neutron Transport and Non-local Branching Markov Processes (2023) Birkhäuser) et la dynamique de la taille des populations.

  • Switching Identities by Probabilistic Means

    by J. Backhoff-Veraguas, A. M. G. Cox, A. Grass, M. Huesmann


  • Open Access

    Linear and uniform in time bound for the binary branching model with Moran type interactions

    by A M G Cox, E Horton, D Villemonais

    In this note, we recall the definition of the binary branching model with Moran type interactions (BBMMI) introduced in [8]. In this interacting particle system, particles evolve, reproduce and die independently and, with a probability that may depend on the configuration of the whole system, the death of a particle may trigger the reproduction of another particle, while a branching event may trigger the death of another particle. We recall its relation to the Feynman-Kac semigroup of the underlying Markov evolution and improve on the L 2 distance between their normalisations proved in [8], when additional regularity is assumed on the process.

    • 29 January 2025
    • Published by HAL in HAL
    Open Access

    Linear and uniform in time bound for the binary branching model with Moran type interactions

    by A Cox, E Horton, D Villemonais

    In this note, we recall the definition of the binary branching model with Moran type interactions (BBMMI) introduced in [8]. In this interacting particle system, particles evolve, reproduce and die independently and, with a probability that may depend on the configuration of the whole system, the death of a particle may trigger the reproduction of another particle, while a branching event may trigger the death of another particle. We recall its relation to the Feynman-Kac semigroup of the underlying Markov evolution and improve on the L 2 distance between their normalisations proved in [8], when additional regularity is assumed on the process.

  • Open Access

    Binary branching processes with Moran type interactions

    by Alexander M. G. Cox, Emma Horton, Denis Villemonais

    The aim of this paper is to study the large population limit of a binary branching particle system with Moran type interactions: we introduce a new model where particles evolve, reproduce and die independently and, with a probability that may depend on the configuration of the whole system, the death of a particle may trigger the reproduction of another particle, while a branching event may trigger the death of an other one. We study the occupation measure of the new model, explicitly relating it to the Feynman-Kac semigroup of the underlying Markov evolution and quantifying the L2 distance between their normalisations. This model extends the fixed size Moran type interacting particle system discussed in [18, 19, 6, 7, 57] and we will indeed show that our model outperforms the latter when used to approximate a birth and death process. We discuss several other applications of our model including the neutron transport equation [36, 15] and population size dynamics.

  • Open Access

    Controlled Measure-Valued Martingales: a Viscosity Solution Approach

    by Alexander M. G. Cox, Sigrid Källblad, Martin Larsson, Sara Svaluto-Ferro

    We consider a class of stochastic control problems where the state process is a probability measure-valued process satisfying an additional martingale condition on its dynamics, called measure-valued martingales (MVMs). We establish the `classical' results of stochastic control for these problems: specifically, we prove that the value function for the problem can be characterised as the unique solution to the Hamilton-Jacobi-Bellman equation in the sense of viscosity solutions. In order to prove this result, we exploit structural properties of the MVM processes. Our results also include an appropriate version of It\^o's lemma for controlled MVMs. We also show how problems of this type arise in a number of applications, including model-independent derivatives pricing, the optimal Skorokhod embedding problem, and two player games with asymmetric information.

  • Open Access

    SDEs with no strong solution arising from a problem of stochastic control

    by Alexander M. G. Cox, Benjamin A. Robinson

    We study a two-dimensional stochastic differential equation that has a unique weak solution but no strong solution. We show that this SDE shares notable properties with Tsirelson's example of a one-dimensional SDE with no strong solution. In contrast to Tsirelson's equation, which has a non-Markovian drift, we consider a strong Markov martingale with Markovian diffusion coefficient. We show that there is no strong solution of the SDE and that the natural filtration of the weak solution is generated by a Brownian motion. We also discuss an application of our results to a stochastic control problem for martingales with fixed quadratic variation in a radially symmetric environment.

  • Open Access

    Optimal control of martingales in a radially symmetric environment

    by Alexander M. G. Cox, Benjamin A. Robinson

    We study a stochastic control problem for continuous multidimensional martingales with fixed quadratic variation. In a radially symmetric environment, we are able to find an explicit solution to the control problem and find an optimal strategy. We show that it is optimal to switch between two strategies, depending only on the radius of the controlled process. The optimal strategies correspond to purely radial and purely tangential motion. It is notable that the value function exhibits smooth fit even when switching to tangential motion, where the radius of the optimal process is deterministic. Under sufficient regularity on the cost function, we prove optimality via viscosity solutions of a Hamilton-Jacobi-Bellman equation. We extend the results to cost functions that may become infinite at the origin. Extra care is required to solve the control problem in this case, since it is not clear how to define the optimal strategy with deterministic radius at the origin. Our results generalise some problems recently considered in Stochastic Portfolio Theory and Martingale Optimal Transport.

  • Open Access

    Monte-Carlo Methods for the Neutron Transport Equation

    by Alexander M. G. Cox, Simon C. Harris, Andreas E. Kyprianou, Minmin Wang

    This paper continues our treatment of the Neutron Transport Equation (NTE) building on the work in [arXiv:1809.00827v2], [arXiv:1810.01779v4] and [arXiv:1901.00220v3], which describes the flux of neutrons through inhomogeneous fissile medium. Our aim is to analyse existing and novel Monte Carlo (MC) algorithms, aimed at simulating the lead eigenvalue associated with the underlying model. This quantity is of principal importance in the nuclear regulatory industry for which the NTE must be solved on complicated inhomogenous domains corresponding to nuclear reactor cores, irradiative hospital equipment, food irradiation equipment and so on. We include a complexity analysis of such MC algorithms, noting that no such undertaking has previously appeared in the literature. The new MC algorithms offer a variety of advantages and disadvantages of accuracy vs cost, as well as the possibility of more convenient computational parallelisation.