arXiv subjects

Nastassia Pouradier Duteil

Publications and source records attributed to Nastassia Pouradier Duteil.

17 recordsLinked to original sources

arXiv2026

Graph-Induced Rotational Twisted States in Systems of Identical Oscillators

In this article, we study a new class of collective motion for identical coupled Stuart-Landau oscillators on graphs. This model was previously known to converge to the synchronized state for a certain class of initial data. Here, we show that when the interaction matrix is circulant, there exists another class of attractors, in which the particles are uniformly distributed on a circle, reminiscent of the \textit{twisted states} known for the Kuramoto model, but which rotate around the origin. However, contrary to the classical Kuramoto case, here the rotation is caused by the asymmetry of the graph structure, and not by the natural frequencies. We identify conditions for the existence and local stability of the \textit{rotational twisted states}, both in the Stuart-Landau model and in the Kuramoto model. We also provide sufficient conditions for the existence and stability of the synchronized state, which can co-exist with the rotational twisted state in a certain parameter region. We provide a generalization of the class of interaction matrices able to generate rotational twisted states via leader-follower interaction matrices. We show that heterogeneous rotational twisted states can also exist for a system of heterogeneous oscillators, attracted to different individual target amplitudes. This study is accompanied by numerical simulations that illustrate the possible behaviors of the system, which also include metastable dynamics and a chimera state.

math.DS↗

arXiv2025

Structured Continuity Equations in Fibred Wasserstein Spaces

In this article, we develop a comprehensive ODE-theory for structured continuity equations in fibred probability spaces, which represent a class of heterogeneous PDEs arising as the meanfield limit nonexchangeable particle systems. After investigating in depth the topologies induced by the so-called fibred and classical Wasserstein metrics on such probability spaces, we establish quantitative Cauchy-Lipschitz and qualitative Carathéodory-Peano well-posedness results for structured continuity equations, along with precise correspondences between this class of evolutions, classical Lagrangian dynamics, and continuity equations. In keeping with what has long been known for exchangeable dynamics, we derive a general meanfield approximation result by solutions of nonexchangeable particle systems, along with a quantitative variant thereof under practically reasonable regularity assumptions on the driving field and initial data.

math.AP↗

arXiv2024

Mean-field limit of non-exchangeable multi-agent systems over hypergraphs with unbounded rank

Interacting particle systems are known for their ability to generate large-scale self-organized structures from simple local interaction rules between each agent and its neighbors. In addition to studying their emergent behavior, a main focus of the mathematical community has been concentrated on deriving their large-population limit. In particular, the mean-field limit consists of describing the limit system by its population density in the product space of positions and labels. The strategy to derive such limits is often based on a careful combination of methods ranging from analysis of PDEs and stochastic analysis, to kinetic equations and graph theory. In this article, we focus on a generalization of multi-agent systems that includes higher-order interactions, which has largely captured the attention of the applied community in the last years. In such models, interactions between individuals are no longer assumed to be binary (i.e. between a pair of particles). Instead, individuals are allowed to interact by groups so that a full group jointly generates a non-linear force on any given individual. The underlying graph of connections is then replaced by a hypergraph, which we assume to be dense, but possibly non uniform and of unbounded rank. For the first time in the literature, we show that when the interaction kernels are regular enough, then the mean-field limit is determined by a limiting Vlasov-type equation, where the hypergraph limit is encoded by a so-called UR-hypergraphon (unbounded-rank hypergraphon), and where the resulting mean-field force admits infinitely-many orders of interactions.

math.AP↗

arXiv2024

Self-similar solutions, regularity and time asymptotics for a nonlinear diffusion equation arising in game theory

In this article, we study the long-time asymptotic properties of a non-linear and non-local equation of diffusive type which describes the rock-paper-scissors game in an interconnected population.We fully characterize the self-similar solution and then prove that the solution of the initial-boundary value problem converges to the self-similar profile with an algebraic rate.

math.AP↗

arXiv2024

Large-population limits of non-exchangeable particle systems

A particle system is said to be non-exchangeable if two particles cannot be exchanged without modifying the overall dynamics. Because of this property, the classical mean-field approach fails to provide a limit equation when the number of particles tends to infinity. In this review, we present novel approaches for the large-population limit of non-exchangeable particle systems, based on the idea of keeping track of the identities of the particles. These can be classified in two categories. The non-exchangeable mean-field limit describes the evolution of the particle density on the product space of particle positions and labels. Instead, the continuum limit allows to obtain an equation for the evolution of each particle's position as a function of its (continuous) label. We expose each of these approaches in the frameworks of static and adaptive networks.

math.AP↗

arXiv2023

An integrative phenotype-structured partial differential equation model for the population dynamics of epithelial-mesenchymal transition

Phenotypic heterogeneity along the epithelial-mesenchymal (E-M) axis contributes to cancer metastasis and drug resistance. Recent experimental efforts have collated detailed time-course data on the emergence and dynamics of E-M heterogeneity in a cell population. However, it remains unclear how different possible processes interplay in shaping the dynamics of E-M heterogeneity: a) intracellular regulatory interaction among biomolecules, b) cell division and death, and c) stochastic cell-state transition (biochemical reaction noise and asymmetric cell division). Here, we propose a Cell Population Balance (Partial Differential Equation (PDE)) based model that captures the dynamics of cell population density along the E-M phenotypic axis due to abovementioned multi-scale cellular processes. We demonstrate how population distribution resulting from intracellular regulatory networks driving cell-state transition gets impacted by stochastic fluctuations in E-M regulatory biomolecules, differences in growth rates among cell subpopulations, and initial population distribution. Further, we reveal that a linear dependence of the cell growth rate on the population heterogeneity is sufficient to recapitulate the faster in vivo growth of orthotopic injected heterogeneous E-M subclones reported before experimentally. Overall, our model contributes to the combined understanding of intracellular and cell-population levels dynamics in the emergence of E-M heterogeneity in a cell population.

math.AP↗

arXiv2023

Graph Limit for Interacting Particle Systems on Weighted Random Graphs

In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of graphons. We prove that as the number of particles tends to infinity, the finite-dimensional particle system converges in probability to the solution of a deterministic graph-limit equation, in which the graphon prescribing the interaction is given by the first moment of the weighted random graph law. We also study interacting particle systems posed on switching weighted random graphs, which are obtained by resetting the weighted random graph at regular time intervals. We show that these systems converge to the same graph-limit equation, in which the interaction is prescribed by a constant-in-time graphon.

math.AP↗

arXiv2023

Consensus Formation in First-Order Graphon Models with Time-Varying Topologies

In this article, we investigate the asymptotic formation of consensus for several classes of time-dependent cooperative graphon dynamics. After motivating the use of this type of macroscopic models to describe multi-agent systems, we adapt the classical notion of scrambling coefficient to this setting, leverage it to establish sufficient conditions ensuring the exponential convergence to consensus with respect to the $L^{\infty}$-norm topology. We then shift our attention to consensus formation expressed in terms of the $L^2$-norm, and prove three different consensus result for symmetric, balanced and strongly connected topologies, which involve a suitable generalisation of the notion of algebraic connectivity to this infinite-dimensional framework. We then show that, just as in the finite-dimensional setting, the notion of algebraic connectivity that we propose encodes information about the connectivity properties of the underlying interaction topology. We finally use the corresponding results to shed some light on the relation between $L^2$- and $L^{\infty}$-consensus formation, and illustrate our contributions by a series of numerical simulations.

math.OC↗

arXiv2023

Long-time behaviour of an advection-selection equation

We study the long-time behaviour of the advection-selection equation $$\partial_tn(t,x)+\nabla \cdot \left(f(x)n(t,x)\right)=\left(r(x)-ρ(t)\right)n(t,x),\quad ρ(t)=\int_{\mathbb{R}^d}{n(t,x)dx}\quad t\geq 0, \; x\in \mathbb{R}^d,$$ with an initial condition $n(0, \cdot)=n^0$. In the field of adaptive dynamics, this equation typically describes the evolution of a phenotype-structured population over time. In this case, $x\mapsto n(t,x)$ represents the density of the population characterised by a phenotypic trait $x$, the advection term `$\nabla \cdot \left(f(x)n(t,x)\right)$' a cell differentiation phenomenon driving the individuals toward specific regions, and the selection term `$\left(r(x)-ρ(t)\right)n(t,x)$' the growth of the population, which is of logistic type through the total population size $ρ(t)=\int_{\mathbb{R}^d}{n(t,x)dx}$. In the one-dimensional case $x\in \mathbb{R}$, we prove that the solution to this equation can either converge to a weighted Dirac mass or to a function in $L^1$. Depending on the parameters $n^0$, $f$ and $r$, we determine which of these two regimes of convergence occurs, and we specify the weight and the point where the Dirac mass is supported, or the expression of the $L^1$-function which is reached.

math.AP↗

arXiv2021

Monostability and bistability of biological switches

Cell-fate transition can be modeled by ordinary differential equations (ODEs) which describe the behavior of several molecules in interaction, and for which each stable equilibrium corresponds to a possible phenotype (or 'biological trait'). In this paper, we focus on simple ODE systems modeling two molecules which each negatively (or positively) regulate the other. It is well-known that such models may lead to monostability or multistability, depending on the selected parameters. However, extensive numerical simulations have led systems biologists to conjecture that in the vast majority of cases, there cannot be more than two stable points. Our main result is a proof of this conjecture. More specifically, we provide a criterion ensuring at most bistability, which is indeed satisfied by most commonly used functions. This includes Hill functions, but also a wide family of convex and sigmoid functions. We also determine which parameters lead to monostability, and which lead to bistability, by developing a more general framework encompassing all our results.

math.DS↗

arXiv2021

Mean-field limit of collective dynamics with time-varying weights

In this paper, we derive the mean-field limit of a collective dynamics model with time-varying weights, for weight dynamics that preserve the total mass of the system as well as indistinguishability of the agents. The limit equation is a transport equation with source, where the (non-local) transport term corresponds to the position dynamics, and the (non-local) source term comes from the weight redistribution among the agents. We show existence and uniqueness of the solution for both microscopic and macroscopic models and introduce a new empirical measure taking into account the weights. We obtain the convergence of the microscopic model to the macroscopic one by showing continuity of the macroscopic solution with respect to the initial data, in the Wasserstein and Bounded Lipschitz topologies.

math.AP↗

arXiv2020

Mean-field and graph limits for collective dynamics models with time-varying weights

In this paper, we study a model for opinion dynamics where the influence weights of agents evolve in time via an equation which is coupled with the opinions' evolution. We explore the natural question of the large population limit with two approaches: the now classical mean-field limit and the more recent graph limit. After establishing the existence and uniqueness of solutions to the models that we will consider, we provide a rigorous mathematical justification for taking the graph limit in a general context. Then, establishing the key notion of indistinguishability, which is a necessary framework to consider the mean-field limit, we prove the subordination of the mean-field limit to the graph one in that context. This actually provides an alternative (but weaker) proof for the mean-field limit. We conclude by showing some numerical simulations to illustrate our results.

math.AP↗

arXiv2018

Sparse control of Hegselmann-Krause models: Black hole and declustering

This paper elaborates control strategies to prevent clustering effects in opinion formation models. This is the exact opposite of numerous situations encountered in the literature where, on the contrary, one seeks controls promoting consensus. In order to promote declustering, instead of using the classical variance that does not capture well the phenomenon of dispersion, we introduce an entropy-type functional that is adapted to measuring pairwise distances between agents. We then focus on a Hegselmann-Krause-type system and design declustering sparse controls both in finite-dimensional and kinetic models. We provide general conditions characterizing whether clustering can be avoided as function of the initial data. Such results include the description of black holes (where complete collapse to consensus is not avoidable), safety zones (where the control can keep the system far from clustering), basins of attraction (attractive zones around the clustering set) and collapse prevention (when convergence to the clustering set can be avoided).

math.OC↗

arXiv2016

Control of reaction-diffusion equations on time-evolving manifolds

Among the main actors of organism development there are morphogens, which are signaling molecules diffusing in the developing organism and acting on cells to produce local responses. Growth is thus determined by the distribution of such signal. Meanwhile, the diffusion of the signal is itself affected by the changes in shape and size of the organism. In other words, there is a complete coupling between the diffusion of the signal and the change of the shapes. In this paper, we introduce a mathematical model to investigate such coupling. The shape is given by a manifold, that varies in time as the result of a deformation given by a transport equation. The signal is represented by a density, diffusing on the manifold via a diffusion equation. We show the non-commutativity of the transport and diffusion evolution by introducing a new concept of Lie bracket between the diffusion and the transport operator. We also provide numerical simulations showing this phenomenon.

math.OC↗

arXiv2016

Interaction Network, State Space and Control in Social Dynamics

In the present chapter we study the emergence of global patterns in large groups in first and second-order multi-agent systems, focusing on two ingredients that influence the dynamics: the interaction network and the state space. The state space determines the types of equilibrium that can be reached by the system. Meanwhile, convergence to specific equilibria depends on the connectivity of the interaction network and on the interaction potential. When the system does not satisfy the necessary conditions for convergence to the desired equilibrium, control can be exerted, both on finite-dimensional systems and on their mean-field limit.

math.DS↗

arXiv2015

Developmental Partial Differential Equations

In this paper, we introduce the concept of Developmental Partial Differential Equation (DPDE), which consists of a Partial Differential Equation (PDE) on a time-varying manifold with complete coupling between the PDE and the manifold's evolution. In other words, the manifold's evolution depends on the solution to the PDE, and vice versa the differential operator of the PDE depends on the manifold's geometry. DPDE is used to study a diffusion equation with source on a growing surface whose growth depends on the intensity of the diffused quantity. The surface may, for instance, represent the membrane of an egg chamber and the diffused quantity a protein activating a signaling pathway leading to growth. Our main objective is to show controllability of the surface shape using a fixed source with variable intensity for the diffusion. More specifically, we look for a control driving a symmetric manifold shape to any other symmetric shape in a given time interval. For the diffusion we take directly the Laplace-Beltrami operator of the surface, while the surface growth is assumed to be equal to the value of the diffused quantity. We introduce a theoretical framework, provide approximate controllability and show numerical results. Future applications include a specific model for the oogenesis of Drosophila melanogaster.

math.OC↗

arXiv2015

Optimal Control of a Collective Migration Model

Collective migration of animals in a cohesive group is rendered possible by a strategic distribution of tasks among members: some track the travel route, which is time and energy-consuming, while the others follow the group by interacting among themselves. In this paper, we study a social dynamics system modeling collective migration. We consider a group of agents able to align their velocities to a global target velocity, or to follow the group via interaction with the other agents. The balance between these two attractive forces is our control for each agent, as we aim to drive the group to consensus at the target velocity. We show that the optimal control strategies in the case of final and integral costs consist of controlling the agents whose velocities are the furthest from the target one: these agents sense only the target velocity and become leaders, while the uncontrolled ones sense only the group, and become followers. Moreover, in the case of final cost, we prove an "Inactivation" principle: there exist initial conditions such that the optimal control strategy consists of letting the system evolve freely for an initial period of time, before acting with full control on the agent furthest from the target velocity.

math.OC↗