Publications

2025

• Refined Analysis of Federated Averaging's Bias and Federated Richardson-Romberg Extrapolation
  
  • Mangold Paul
  • Durmus Alain
  • Dieuleveut Aymeric
  • Samsonov Sergey
  • Moulines Eric
  , 2025. In this paper, we present a novel analysis of FedAvg with constant step size, relying on the Markov property of the underlying process. We demonstrate that the global iterates of the algorithm converge to a stationary distribution and analyze its resulting bias and variance relative to the problem's solution. We provide a first-order bias expansion in both homogeneous and heterogeneous settings. Interestingly, this bias decomposes into two distinct components: one that depends solely on stochastic gradient noise and another on client heterogeneity. Finally, we introduce a new algorithm based on the Richardson-Romberg extrapolation technique to mitigate this bias.
• Wavelet-Based Multiscale Flow For Realistic Image Deformation in the Large Diffeomorphic Deformation Model Framework
  
  • Gaudfernau Fleur
  • Blondiaux Eléonore
  • Allassonnière Stéphanie
  • Le Pennec Erwan
  Journal of Mathematical Imaging and Vision, Springer Verlag, 2025, 67 (2), pp.10. Estimating accurate high-dimensional transformations remains very challenging, especially in a clinical setting. In this paper, we introduce a multiscale parameterization of deformations to enhance registration and atlas estimation in the Large Deformation Diffeomorphic Metric Mapping framework. Using the Haar wavelet transform, a multiscale representation of the initial velocity fields is computed to optimize transformations in a coarse-to-fine fashion. This additional layer of spatial regularization does not modify the underlying model of deformations. As such, it preserves the original kernel Hilbert space structure of the velocity fields, enabling the algorithm to perform efficient gradient descent. Numerical experiments on several datasets, including abnormal fetal brain images, show that compared to the original algorithm, the coarse-to-fine strategy reaches higher performance and yields template images that preserve important details while avoiding unrealistic features. This highly versatile strategy can easily be applied to other mathematical frameworks for almost no additional computational cost. (10.1007/s10851-024-01219-5)
  DOI : 10.1007/s10851-024-01219-5
• Surface Waves in Randomly Perturbed Discrete Models
  
  • Garnier Josselin
  • Sharma Basant Lal
  Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, Society for Industrial and Applied Mathematics, 2025, 23 (1), pp.158-186. (10.1137/24M165510X)
  DOI : 10.1137/24M165510X
• Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2 -distance
  
  • Gentiloni-Silveri Marta
  • Ocello Antonio
  , 2025. Score-based Generative Models (SGMs) aim to sample from a target distribution by learning score functions using samples perturbed by Gaussian noise. Existing convergence bounds for SGMs in the W2-distance rely on stringent assumptions about the data distribution. In this work, we present a novel framework for analyzing W2-convergence in SGMs, significantly relaxing traditional assumptions such as log-concavity and score regularity. Leveraging the regularization properties of the Ornstein-Uhlenbeck (OU) process, we show that weak log-concavity of the data distribution evolves into log-concavity over time. This transition is rigorously quantified through a PDE-based analysis of the Hamilton-Jacobi-Bellman equation governing the log-density of the forward process. Moreover, we establish that the drift of the time-reversed OU process alternates between contractive and noncontractive regimes, reflecting the dynamics of concavity. Our approach circumvents the need for stringent regularity conditions on the score function and its estimators, relying instead on milder, more practical assumptions. We demonstrate the wide applicability of this framework through explicit computations on Gaussian mixture models, illustrating its versatility and potential for broader classes of data distributions.
• Optimisation of space-time periodic eigenvalues
  
  • Bogosel Beniamin
  • Mazari Idriss
  • Nadin Grégoire
  , 2025. <div><p>The goal of this paper is to provide a qualitative analysis of the optimisation of space-time periodic principal eigenvalues. Namely, considering a fixed time horizon T and the d-dimensional torus T d , let, for any m ∈ L ∞ ((0, T ) × T d ), λ(m) be the principal eigenvalue of the operator ∂t -∆ -m endowed with (time-space) periodic boundary conditions. The main question we set out to answer is the following: how to choose m so as to minimise λ(m)? This question stems from population dynamics. We prove that in several cases it is always beneficial to rearrange m with respect to time in a symmetric way, which is the first comparison result for the rearrangement in time of parabolic equations. Furthermore, we investigate the validity (or lack thereof) of Talenti inequalities for the rearrangement in time of parabolic equations. The numerical simulations which illustrate our results were obtained by developing a framework within which it is possible to optimise criteria with respect to functions having a prescribed rearrangement (or distribution function).</p></div>
• Polynomial approximations in a generalized Nyman–Beurling criterion
  
  • Alouges François
  • Darses Sébastien
  • Hillion Erwan
  , 2023, pp.767 - 785. The Nyman-Beurling criterion, equivalent to the Riemann hypothesis, is an approximation problem in the space of square integrable functions on $(0,\infty)$, involving dilations of the fractional part function by factors $\theta_k\in(0,1)$, $k\ge1$. Randomizing the $\theta_k$ generates new structures and criteria. One of them is a sufficient condition that splits into (i) showing that the indicator function can be approximated by convolution with the fractional part, (ii) a control on the coefficients of the approximation. This self-contained paper aims at identifying functions for which (i) holds unconditionally, by means of polynomial approximations. This yields in passing a short probabilistic proof of a known consequence of Wiener's Tauberian theorem. In order to tackle (ii) in the future, we give some expressions of the scalar products. New and remarkable structures arise for the Gram matrix, in particular moment matrices for a suitable weight that may be the squared $\Xi$-function for instance. (10.5802/jtnb.1227)
  DOI : 10.5802/jtnb.1227
• An exterior optimal transport problem
  
  • Candau-Tilh Jules
  • Goldman Michael
  • Merlet Benoît
  Calculus of Variations and Partial Differential Equations, Springer Verlag, 2025, 64 (2), pp.45. This paper deals with a variant of the optimal transportation problem. Given f ∈ L 1 (R d , [0, 1]) and a cost function c ∈ C(R d × R d) of the form c(x, y) = k(y − x), we minimise ∫ c dγ among transport plans γ whose first marginal is f and whose second marginal is not prescribed but constrained to be smaller than 1 − f. Denoting by Υ(f) the infimum of this problem, we then consider the maximisation problem sup{Υ(f) : ∫ f = m} where m &gt; 0 is given. We prove that maximisers exist under general assumptions on k, and that for k radial, increasing and coercive these maximisers are the characteristic functions of the balls of volume m. (10.1007/s00526-024-02900-8)
  DOI : 10.1007/s00526-024-02900-8
• Bayesian calibration for prediction in a multi-output transposition context
  
  • Sire Charlie
  • Garnier Josselin
  • Kerleguer Baptiste
  • Durantin Cédric
  • Defaux Gilles
  • Perrin Guillaume
  International Journal for Uncertainty Quantification, Begell House Publishers, 2025, 15 (6), pp.37-59. Numerical simulations are widely used to predict the behavior of physical systems, with Bayesian approaches being particularly well suited for this purpose. However, experimental observations are necessary to calibrate certain simulator parameters for the prediction. In this work, we use a multi-output simulator to predict all its outputs, including those that have never been experimentally observed. This situation is referred to as the transposition context. To accurately quantify the discrepancy between model outputs and real data in this context, conventional methods cannot be applied, and the Bayesian calibration must be augmented by incorporating a joint model error across all outputs. To achieve this, the proposed method is to consider additional numerical input parameters within a hierarchical Bayesian model, which includes hyperparameters for the prior distribution of the calibration variables. This approach is applied on a computer code with three outputs that models the Taylor cylinder impact test with a small number of observations. The outputs are considered as the observed variables one at a time, to work with three different transposition situations. The proposed method is compared with other approaches that embed model errors to demonstrate the significance of the hierarchical formulation. (10.1615/Int.J.UncertaintyQuantification.2025056586)
  DOI : 10.1615/Int.J.UncertaintyQuantification.2025056586
• Provable non-accelerations of the heavy-ball method
  
  • Goujaud Baptiste
  • Taylor Adrien
  • Dieuleveut Aymeric
  Mathematical Programming, Springer Verlag, 2025. In this work, we show that the heavy-ball ($\HB$) method provably does not reach an accelerated convergence rate on smooth strongly convex problems. More specifically, we show that for any condition number and any choice of algorithmic parameters, either the worst-case convergence rate of $\HB$ on the class of $L$-smooth and $μ$-strongly convex \textit{quadratic} functions is not accelerated (that is, slower than $1 - \mathcal{O}(κ)$), or there exists an $L$-smooth $μ$-strongly convex function and an initialization such that the method does not converge. To the best of our knowledge, this result closes a simple yet open question on one of the most used and iconic first-order optimization technique. Our approach builds on finding functions for which $\HB$ fails to converge and instead cycles over finitely many iterates. We analytically describe all parametrizations of $\HB$ that exhibit this cycling behavior on a particular cycle shape, whose choice is supported by a systematic and constructive approach to the study of cycling behaviors of first-order methods. We show the robustness of our results to perturbations of the cycle, and extend them to class of functions that also satisfy higher-order regularity conditions. (10.1007/s10107-025-02269-2)
  DOI : 10.1007/s10107-025-02269-2
• Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing
  
  • Bonet Clément
  • Cazelles Elsa
  • Drumetz Lucas
  • Courty Nicolas
  , 2025. The Busemann function has recently found much interest in a variety of geometric machine learning problems, as it naturally defines projections onto geodesic rays of Riemannian manifolds and generalizes the notion of hyperplanes. As several sources of data can be conveniently modeled as probability distributions, it is natural to study this function in the Wasserstein space, which carries a rich formal Riemannian structure induced by Optimal Transport metrics. In this work, we investigate the existence and computation of Busemann functions in Wasserstein space, which admits geodesic rays. We establish closed-form expressions in two important cases: one-dimensional distributions and Gaussian measures. These results enable explicit projection schemes for probability distributions on $\mathbb{R}$, which in turn allow us to define novel Sliced-Wasserstein distances over Gaussian mixtures and labeled datasets. We demonstrate the efficiency of those original schemes on synthetic datasets as well as transfer learning problems. (10.48550/arXiv.2510.04579)
  DOI : 10.48550/arXiv.2510.04579
• Understanding the worst-kept secret of high-frequency trading
  
  • Pulido Sergio
  • Rosenbaum Mathieu
  • Sfendourakis Emmanouil
  Finance and Stochastics, Springer Verlag (Germany), 2025. Volume imbalance in a limit order book is often considered as a reliable indicator for predicting future price moves. In this work, we seek to analyse the nuances of the relationship between prices and volume imbalance. To this end, we study a market-making problem which allows us to view the imbalance as an optimal response to price moves. In our model, there is an underlying efficient price driving the mid-price, which follows the model with uncertainty zones. A single market maker knows the underlying efficient price and consequently the probability of a mid-price jump in the future. She controls the volumes she quotes at the best bid and ask prices. Solving her optimization problem allows us to understand endogenously the price-imbalance connection and to confirm in particular that it is optimal to quote a predictive imbalance. Our model can also be used by a platform to select a suitable tick size, which is known to be a crucial topic in financial regulation. The value function of the market maker's control problem can be viewed as a family of functions, indexed by the level of the market maker's inventory, solving a coupled system of PDEs. We show existence and uniqueness of classical solutions to this coupled system of equations. In the case of a continuous inventory, we also prove uniqueness of the market maker's optimal control policy.
• Kinetic theory and moment models of electrons in a reactive weakly-ionized non-equilibrium plasma
  
  • Laguna Alejandro Alvarez
  • Pichard Teddy
  Kinetic and Related Models, AIMS, 2025. <div><p>We study the electrons in a multi-component weakly-ionized plasma with an external electric field under conditions that are far from thermodynamic equilibrium, representative of a gas discharge plasma. Our starting point is the generalized Boltzmann equation with elastic, inelastic and reactive collisions. We perform a dimensional analysis of the equation and an asymptotic analysis of the collision operators for small electron-to-atom mass ratios and small ionization levels. The dimensional analysis leads to a diffusive scaling for the electron transport. We perform a Hilbert expansion of the electron distribution function that, in the asymptotic limit, results in a reduced model characterized by a spherically symmetric distribution function in the velocity space with a small anisotropic perturbation. We show that the spherical-harmonics expansion model, widely used in low-temperature plasmas, is a particular case of our approach. We approximate the solution of our kinetic model with a truncated moment hierarchy. Finally, we study the moment problem for a particular case: a Langevin collision (equivalent to Maxwell molecules) for the electron-gas elastic collisions. The resulting Stieltjes moment problem leads to an advection-diffusion-reaction system of equations that is approximated with two different closures: the quadrature method of moments and a Hermitian moment closure. A special focus is given along the derivations and approximations to the notion of entropy dissipation.</p></div> (10.3934/krm.2025007)
  DOI : 10.3934/krm.2025007
• An analysis of the noise schedule for score-based generative models
  
  • Strasman Stanislas
  • Ocello Antonio
  • Boyer Claire
  • Le Corff Sylvain
  • Lemaire Vincent
  Transactions on Machine Learning Research Journal, [Amherst Massachusetts]: OpenReview.net, 2022, 2025. Score-based generative models (SGMs) aim at estimating a target data distribution by learning score functions using only noise-perturbed samples from the target. Recent literature has focused extensively on assessing the error between the target and estimated distributions, gauging the generative quality through the Kullback-Leibler (KL) divergence and Wasserstein distances. Under mild assumptions on the data distribution, we establish an upper bound for the KL divergence between the target and the estimated distributions, explicitly depending on any time-dependent noise schedule. Under additional regularity assumptions, taking advantage of favorable underlying contraction mechanisms, we provide a tighter error bound in Wasserstein distance compared to state-of-the-art results. In addition to being tractable, this upper bound jointly incorporates properties of the target distribution and SGM hyperparameters that need to be tuned during training. Finally, we illustrate these bounds through numerical experiments using simulated and CIFAR-10 datasets, identifying an optimal range of noise schedules within a parametric family.
• Solving inverse source wave problem from Carleman estimates to observer design
  
  • Boulakia Muriel
  • de Buhan Maya
  • Delaunay Tiphaine
  • Imperiale Sébastien
  • Moireau Philippe
  Mathematical Control and Related Fields, AIMS, 2025. In this work, we are interested by the identification in a wave equation of a space dependent source term multiplied by a known time and space dependent function, from internal velocity or field measurements. The first part of the work consists in proving stability inequalities associated with this inverse problem from adapted Carleman estimates. Then, we present a sequential reconstruction strategy which is proved to be equivalent to the minimization of a cost functional with Tikhonov regularization. Based on the obtained stability estimates, the reconstruction error is evaluated with respect to the noise intensity. Finally, the proposed method is illustrated with numerical simulations, both in the case of regular source terms and of piecewise constant source terms. (10.3934/mcrf.2025007)
  DOI : 10.3934/mcrf.2025007
• Macroscopic limit from a structured population model to the Kirkpatrick-Barton model
  
  • Raoul Gaël
  Bulletin des Sciences Mathématiques, Elsevier, 2025, 205, pp.103697. We consider an ecology model in which the population is structured by a spatial variable and a phenotypic trait. The model combines a parabolic operator on the spatial variable with a kinetic operator on the trait variable. We prove the existence of solutions to that model, and show that these solutions are unique. The kinetic operator present in the model, that represents the effect of sexual reproductions, satisfies a Tanaka-type inequality: it implies a contraction of the Wasserstein distance in the space of phenotypic traits. We combine this contraction argument with parabolic estimates controlling the spatial regularity of solutions to prove the convergence of the population size and the mean phenotypic trait to solutions of the Kirkpatrick-Barton model, which is a well-established model in evolutionary ecology. Specifically, at high reproductive rates, we provide explicit convergence estimates for the moments of solutions of the kinetic model. (10.48550/arXiv.1706.04094)
  DOI : 10.48550/arXiv.1706.04094
• From Stochastic Zakharov System to Multiplicative Stochastic Nonlinear Schrödinger Equation
  
  • Barrué Grégoire
  • de Bouard Anne
  • Debussche Arnaud
  Stochastics and Partial Differential Equations: Analysis and Computations, Springer US, 2025, pp.1-40. We study the convergence of a Zakharov system driven by a time white noise, colored in space, to a multiplicative stochastic nonlinear Schrödinger equation, as the ion-sound speed tends to infinity. In the absence of noise, the conservation of energy gives bounds on the solutions, but this evolution becomes singular in the presence of the noise. To overcome this difficulty, we show that the problem may be recasted in the diffusion-approximation framework, and make use of the perturbed test-function method. We also obtain convergence in probability. The result is limited to dimension one, to avoid too much technicalities. As a prerequisite, we prove the existence and uniqueness of regular solutions of the stochastic Zakharov system.
• Development of a rabbit model of uterine rupture after caesarean section, Histological, biomechanical and polarimetric analysis of the uterine tissue
  
  • Debras Elodie
  • Maudot Constance
  • Allain Jean-Marc
  • Pierangelo Angelo
  • Courilleau Aymeric
  • Rivière Julie
  • Dahirel Michèle
  • Richard Christophe
  • Gelin Valérie
  • Morin Gwendoline
  • Capmas Perrine
  • Chavatte-Palmer Pascale
  Reproduction & Fertility, Bioscientifica Ltd, 2025. Uterine rupture is a major complication of caesarean section (CS) associated with a high foetal and maternal morbidity. The objective is to develop an in-vivo model of uterus healing and rupture after CS in order to analyse histological phenomena controlling scarring tissue development and potential cause of defects. Eighteen pregnant primiparous female rabbits were bred naturally. At caesarean, after 28 days of gestation, foetuses were either extracted through a longitudinal incision in one of the uterine horns (“CS horn”) or via a short incision at the tip of the contralateral horn (“control horn”). The uterine horns were sutured by single layer, all by the same surgeon. They were mated again 14 days later and euthanized at G28. Genital tracts were collected for histological, biomechanical and polarimetric analyses. Macroscopically, 2/18 presented a dehiscence and 1/18 a spontaneous rupture. The mean thickness of the scarred area was significantly lower 0.9 mm [0.7-1.4] that the non-scarring area on CS horns 2.2 [1.6-2.3] or control horns 2 [1.5-2.3] (p&lt;0.0001). The scar zone was statistically more fibrous (p&lt;0.0001), containing fewer vessels (p=0.03) and oestrogen (p&lt;0.001) and progesterone receptors (p&lt;0.0001). After balloon inflation, ruptured occurred in the scar zone in 8 out of 17 cases (47%). Polarimetry revealed that the scar zone was statistically inhomogeneous (73%). Multifactorial analysis allowed to identify groups with poor uterine healing and less resistant to rupture (balloon inflation) mostly in case of thin myometrium in the scar and a group with strong resistant to rupture and correct healing characteristics. Lay summary Caesarean section rates are rising across the world. When a caesarean section is carried out, it can lead to scarring on the uterus that can affect its resistance to pressure. During the next pregnancy, the uterus can tear, increasing risks to the mother and baby. We carried out caesarean sections in a rabbit, allowing us to analyse the scar on the uterus, the healing and tissue resistance. The scarred part of the uterus was statistically thinner, more fibrous and contained fewer vessels and hormone receptors than the area without scarring. Under similar conditions, poor healing was observed in some animals, reducing resistance in following pregnancies. These results suggest that individual and genetic factor have an effect on healing after a caesarean section. This study may enable us to improve our knowledge and management care for patients who have a caesarean section in order to reduce complications. (10.1530/raf-25-0018)
  DOI : 10.1530/raf-25-0018
• Tensor rectifiable G-flat chains
  
  • Goldman Michael
  • Merlet Benoît
  Transactions of the American Mathematical Society, American Mathematical Society, 2025. A rigidity result for normal rectifiable $k$-chains in $\mathbb{R}^n$ with coefficients in an Abelian normed group is established. Given some decompositions $k=k_1+k_2$, $n=n_1+n_2$ and some rectifiable $k$-chain $A$ in $\mathbb{R}^n$, we consider the properties: (1) The tangent planes to $\mu_A$ split as $T_x\mu_A=L^1(x)\times L^2(x)$ for some $k_1$-plane $L^1(x)\subset\mathbb{R}^{n_1}$ and some $k_2$-plane $L^2(x)\subset\mathbb{R}^{n_2}$. (2) $A=A_{\vert\Sigma^1\times\Sigma^2}$ for some sets $\Sigma^1\subset\mathbb{R}^{n_1}$, $\Sigma^2\subset\mathbb{R}^{n_2}$ such that $\Sigma^1$ is $k_1$-rectifiable and $\Sigma^2$ is $k_2$-rectifiable (we say that $A$ is $(k_1,k_2)$-rectifiable). The main result is that for normal chains, (1) implies (2), the converse is immediate. In the proof we introduce the new groups of tensor flat chains (or $(k_1,k_2)$-chains) in $\mathbb{R}^{n_1}\times\mathbb{R}^{n_2}$ which generalize Fleming's $G$-flat chains. The other main tool is White's rectifiable slices theorem. We show that on the one hand any normal rectifiable chain satisfying~(1) identifies with a normal rectifiable $(k_1,k_2)$-chain and that on the other hand any normal rectifiable $(k_1,k_2)$-chain is $(k_1,k_2)$-rectifiable. (10.1090/tran/9392)
  DOI : 10.1090/tran/9392
• A holographic global uniqueness in passive imaging
  
  • Novikov Roman
  Journal de l'École polytechnique — Mathématiques, École polytechnique, 2025, 12, pp.1069-1081. We consider a radiation solution $\psi$ for the Helmholtz equation in an exterior region in $\mathbb R^3$. We show that the restriction of $\psi$ to any ray $L$ in the exterior region is uniquely determined by its imaginary part Im $\psi$ on an interval of this ray. As a corollary, the restriction of $\psi$ to any plane $X$ in the exterior region is uniquely determined by Im $\psi$ on an open domain in this plane. These results have holographic prototypes in the recent work Novikov (2024, Proc. Steklov Inst. Math. 325, 218-223). In particular, these and known results imply a holographic type global uniqueness in passive imaging and for the Gelfand-Krein-Levitan inverse problem (from boundary values of the spectral measure in the whole space) in the monochromatic case. Some other surfaces for measurements instead of the planes $X$ are also considered. (10.5802/jep.306)
  DOI : 10.5802/jep.306
• Integrating Aggregated Electric Vehicle Flexibilities in Unit Commitment Models using Submodular Optimization
  
  • Arvis Hélène
  • Beaude Olivier
  • Gast Nicolas
  • Gaubert Stéphane
  • Gaujal Bruno
  , 2025. <div><p>The Unit Commitment (UC) problem consists in controlling a large fleet of heterogeneous electricity production units in order to minimize the total production cost while satisfying consumer demand. Electric Vehicles (EVs) are used as a source of flexibility and are often aggregated for problem tractability. We develop a new approach to integrate EV flexibilities in the UC problem and exploit the generalized polymatroid structure of aggregated flexibilities of a large population of users to develop an exact optimization algorithm, combining a cutting-plane approach and submodular optimization. We show in particular that the UC can be solved exactly in a time which scales linearly, up to a logarithmic factor, in the number of EV users when each production unit is subject to convex constraints. We illustrate our approach by solving a real instance of a long-term UC problem, combining open-source data of the European grid (European Resource Adequacy Assessment project) and data originating from a survey of user behavior of the French EV fleet.</p></div>
• Parameters estimation of a Threshold CKLS process from continuous and discrete observations
  
  • Mazzonetto Sara
  • Nieto Benoît
  Scandinavian Journal of Statistics, Wiley, 2025, 52 (4), pp.1670-1707. We consider a continuous time process that is self-exciting and ergodic, called threshold Chan–Karolyi–Longstaff–Sanders (CKLS) process. This process is a generalization of various models in econometrics, such as Vasicek model, Cox-Ingersoll-Ross, and Black-Scholes, allowing for the presence of several thresholds which determine changes in the dynamics. We study the asymptotic behavior of maximum-likelihood and quasi-maximum-likelihood estimators of the drift parameters in the case of continuous time and discrete time observations. We show that for high frequency observations and infinite horizon the estimators satisfy the same asymptotic normality property as in the case of continuous time observations. We also discuss diffusion coefficient estimation. Finally, we apply our estimators to simulated and real data to motivate considering (multiple) thresholds. (10.1111/sjos.70005)
  DOI : 10.1111/sjos.70005
• Dynamics of a kinetic model describing protein exchanges in a cell population
  
  • Magal Pierre
  • Raoul Gaël
  Journal of Mathematical Biology, Springer, 2025, 91 (6), pp.76. We consider a cell population structured by a positive real number, describing the number of P-glycoproteins carried by the cell. We are interested in the effect of those proteins on the growth of the population: those proteins are indeed involve in the resistance of cancer cells to chemotherapy drugs. To describe this dynamics, we introduce a kinetic model. We then introduce a rigorous hydrodynamic limit, showing that if the exchanges are frequent, then the dynamics of the model can be described by a system of two coupled differential equations. Finally, we also show that the kinetic model converges to a unique limit in large times. The main idea of this analysis is to use Wasserstein distance estimates to describe the effect of the kinetic operator, combined to more classical estimates on the macroscopic quantities. (10.1007/s00285-025-02295-w)
  DOI : 10.1007/s00285-025-02295-w
• Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
  
  • Allamigeon Xavier
  • Gaubert Stéphane
  • Katz Ricardo
  • Skomra Mateusz
  Information and Computation, Elsevier, 2025, 302, pp.105236. We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an oracle, evaluating the dynamic programming operator up to a given precision. We show that the number of calls to the oracle needed to determine exact optimal (positional) strategies is, up to a factor polynomial in the dimension, of order R/sep, where the “separation” sep is defined as the minimal difference between distinct values arising from strategies, and R is a metric estimate, involving the norm of approximate sub and super-eigenvectors of the dynamic programming operator. We illustrate this method by two applications. The first one is a new proof, leading to improved complexity estimates, of a theorem of Boros, Elbassioni, Gurvich and Makino, showing that turn-based mean-payoff games with a fixed number of random positions can be solved in pseudo-polynomial time. The second one concerns entropy games, a model introduced by Asarin, Cervelle, Degorre, Dima, Horn and Kozyakin. The rank of an entropy game is defined as the maximal rank among all the ambiguity matrices determined by strategies of the two players. We show that entropy games with a fixed rank, in their original formulation, can be solved in polynomial time, and that an extension of entropy games incorporating weights can be solved in pseudo-polynomial time under the same fixed rank condition. (10.1016/j.ic.2024.105236)
  DOI : 10.1016/j.ic.2024.105236
• A new approach for the unitary Dyson Brownian motion through the theory of viscosity solutions
  
  • Bertucci Charles
  • Pesce Valentin
  , 2025. In this paper, we study the unitary Dyson Brownian motion through a partial differential equation approach recently introduced for the real Dyson case. The main difference with the real Dyson case is that the spectrum is now on the circle and not on the real line, which leads to particular attention to comparison principles. First we recall why the system of particles which are the eigenvalues of unitary Dyson Brownian motion is well posed thanks to a containment function. Then we proved that the primitive of the limit spectral measure of the unitary Dyson Brownian motion is the unique solution to a viscosity equation obtained by primitive the Dyson equation on the circle. Finally, we study some properties of solutions of Dyson's equation on the circle. We prove a L ∞ regularization. We also look at the long time behaviour in law of a solution through a study of the so-called free entropy of the system. We conclude by discussing the uniform convergence towards the uniform measure on the circle of a solution of the Dyson equation.
• Optimal Liquidation with Signals: the General Propagator Case
  
  • Abi Jaber Eduardo
  • Neuman Eyal
  Mathematical Finance, Wiley, 2025, 35 (4), pp.841–866. We consider a class of optimal liquidation problems where the agent's transactions create transient price impact driven by a Volterra-type propagator along with temporary price impact. We formulate these problems as minimization of a revenue-risk functionals, where the agent also exploits available information on a progressively measurable price predicting signal. By using an infinite dimensional stochastic control approach, we characterize the value function in terms of a solution to a free-boundary $L^2$-valued backward stochastic differential equation and an operator-valued Riccati equation. We then derive analytic solutions to these equations which yields an explicit expression for the optimal trading strategy. We show that our formulas can be implemented in a straightforward and efficient way for a large class of price impact kernels with possible singularities such as the power-law kernel.