Multiscale dynamics of an adaptive catalytic network

DOI10.1051/MMNP/2019015zbMATH Open1418.37086arXiv1903.00046OpenAlexW2918577583MaRDI QIDQ5229655FDOQ5229655

Authors: Christian Kuehn 

Publication date: 16 August 2019

Published in: Mathematical Modelling of Natural Phenomena (Search for Journal in Brave)

Abstract: We study the multiscale structure of the Jain-Krishna adaptive network model. This model describes the co-evolution of a set of continuous-time autocatalytic ordinary differential equations and its underlying discrete-time graph structure. The graph dynamics is governed by deletion of vertices with asymptotically weak concentrations of prevalence and then re-insertion of vertices with new random connections. In this work we prove several results about convergence of the continuous-time dynamics to equilibrium points. Furthermore, we motivate via formal asymptotic calculations several conjectures regarding the discrete-time graph updates. In summary, our results clearly show that there are several time scales in the problem depending upon system parameters, and that analysis can be carried out in certain singular limits. This shows that for the Jain-Krishna model, and potentially many other adaptive network models, a mixture of deterministic and/or stochastic multiscale methods is a good approach to work towards a rigorous mathematical analysis.

Full work available at URL: https://arxiv.org/abs/1903.00046

Recommendations

• AGGREGATE DYNAMICS IN AN EVOLUTIONARY NETWORK MODEL
• A model of an autocatalytic network formed by error-prone self- replicative species
• On fast-slow consensus networks with a dynamic weight
• Autocatalytic networks: an intimate relation between network topology and dynamics
• Dynamics of small autocatalytic reaction networks. I: Bifurcations, permanence and exclusion

zbMATH Keywords

random graphautocatalytic reactionnetwork dynamicspre-biotic evolutionadaptive networkco-evolutionary networkJain-Krishna modelmultiple time scale system

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Neural networks for/in biological studies, artificial life and related topics (92B20) Dynamics induced by flows and semiflows (37C10) Generation, random and stochastic difference and differential equations (37H10) Multiple scale methods for ordinary differential equations (34E13)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Poisson convergence and Poisson processes with applications to random graphs
• Geometric singular perturbation theory for ordinary differential equations
• Random graphs.
• Multiple time scale dynamics
• Title not available (Why is that?)
• Detecting autocatalytic, self-sustaining sets in chemical reaction systems
• The first cycles in an evolving graph
• Balancing quarantine and self-distancing measures in adaptive epidemic networks
• First cycles in random directed graph processes
• Complex and Adaptive Dynamical Systems

Cited In (7)

• Recurrent chaotic clustering and slow chaos in adaptive networks
• Continuum limits for adaptive network dynamics
• Autocatalytic sets in polymer networks with variable catalysis distributions
• On fast-slow consensus networks with a dynamic weight
• Lifetimes of small catalytic networks
• Adaptive dynamical networks
• Cluster compartmentalization may provide resistance to parasites for catalytic networks

This page was built for publication: Multiscale dynamics of an adaptive catalytic network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229655)