Search arXivSearch

arXiv · 2310.19039

Machine Learning for the identification of phase-transitions in interacting agent-based systems: a Desai-Zwanzig example

Abstract

Deriving closed-form, analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs). In this paper, we propose a data-driven framework that pinpoints phase transitions for an ABM- the Desai-Zwanzig model in its mean-field limit, using a smaller number of variables than traditional closed-form models. To this end, we use the manifold learning algorithm Diffusion Maps to identify a parsimonious set of data-driven latent variables, and show that they are in one-to-one correspondence with the expected theoretical order parameter of the ABM. We then utilize a deep learning framework to obtain a conformal reparametrization of the data-driven coordinates that facilitates, in our example, the identification of a single parameter-dependent ODE in these coordinates. We identify this ODE through a residual neural network inspired by a numerical integration scheme (forward Euler). We then use the identified ODE - enabled through an odd symmetry transformation - to construct the bifurcation diagram exhibiting the phase transition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikolaos Evangelou, Dimitrios G. Giovanis, George A. Kevrekidis, Grigorios A. Pavliotis, Ioannis G. Kevrekidis. 2024-07-17. Machine Learning for the identification of phase-transitions in interacting agent-based systems: a Desai-Zwanzig example. https://doi.org/10.1103/physreve.110.014121

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Monotonicity, global symplectification and the stability of Dry Ten Martini Problem

We prove that, for every irrational frequency and every analytic Type I potential, each supercritical spectral energy satisfying the gap-labelling condition is an endpoint of an open spectral gap. This establishes the conjecture of Ge--Jitomirskaya--You \cite{GJY,You} in the supercritical regime. Consequently, the ``all gaps open'' property of the supercritical almost Mathieu operator persists under sufficiently small analytic perturbations. The main ingredient is a global symplectification of the center bundle that preserves quantitative monotonicity. This allows us to study gap opening through the center dynamics of the dual long-range operator, which has no natural Schrödinger form. We first establish the result for trigonometric polynomial potentials and then pass to general analytic potentials by controlling the dependence on the truncation dimension. The proof combines a discrete Hellmann--Feynman identity, dimension-free Aubry duality in weighted analytic norms, and a quantitative cone argument based on pre-monotonicity. These estimates ensure that the gaps survive in the analytic limit. Our results establish analytic stability of the Dry Ten Martini Problem in the supercritical regime and give a partial answer to a question of M. Shamis on the persistence of periodic spectral gaps.

math.DS

Asymmetry of a class of Mellin transforms via bounded solutions

We introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter $s$ in the critical strip. We identify sufficient conditions on the non-homogeneous term that induce a structural asymmetry between the solutions corresponding to the parameters $s$ and $1-s$. More precisely, if both solutions with initial value $1$ are bounded on $[1,\infty)$, then necessarily $\Re(s)=\tfrac12$. The initial condition associated with the unique bounded solution corresponding to a parameter $s$ represents a zero of the Mellin transform associated with the non-homogeneous term at the point $s$.

math.DS

Self-similar Delone sets and Pisot numbers

We consider Delone point patterns with self-similarity. Under mild conditions, the similarity factor is a Pisot number if and only if the pattern is uniformly discrete. The classical case is a Meyer set $Λ$ with $Λ\supset θΛ$ for some $θ>1,$ for which $θ$ must be a Pisot number or a Salem number. When $Λ$ contains several similar copies of itself, the case of a Salem number drops out for $θ<2.$ On the other hand, strictly self-similar patterns with a Pisot factor must be Meyer sets. Various examples are given.

math.DS