arXiv subjects

Marios Antonios Gkogkas

Publications and source records attributed to Marios Antonios Gkogkas.

3 recordsLinked to original sources

arXiv2025

Mean field limits of co-evolutionary signed heterogeneous networks

Many science phenomena are modelled as interacting particle systems (IPS) coupled on static networks. In reality, network connections are far more dynamic. Connections among individuals receive feedback from nearby individuals and make changes to better adapt to the world. Hence, it is reasonable to model myriad real-world phenomena as co-evolutionary (or adaptive) networks. These networks are used in different areas including telecommunication, neuroscience, computer science, biochemistry, social science, as well as physics, where Kuramoto-type networks have been widely used to model interaction among a set of oscillators. In this paper, we propose a rigorous formulation for limits of a sequence of co-evolutionary Kuramoto oscillators coupled on heterogeneous co-evolutionary networks, which receive both positive and negative feedback from the dynamics of the oscillators on the networks. We show under mild conditions, the mean field limit (MFL) of the co-evolutionary network exists and the sequence of co-evolutionary Kuramoto networks converges to this MFL. Such MFL is described by solutions of a generalized Vlasov equation. We treat the graph limits as signed graph measures, motivated by the recent work in [Kuehn, Xu. Vlasov equations on digraph measures, JDE, 339 (2022), 261--349]. In comparison to the recently emerging works on MFLs of IPS coupled on non-co-evolutionary networks (i.e., static networks or time-dependent networks independent of the dynamics of the IPS), our work seems the first to rigorously address the MFL of a co-evolutionary network model.

math.DS↗

arXiv2022

Graphop Mean-Field Limits and Synchronization for the Stochastic Kuramoto Model

Models of coupled oscillator networks play an important role in describing collective synchronization dynamics in biological and technological systems. The Kuramoto model describes oscillator's phase evolution and explains the transition from incoherent to coherent oscillations under simplifying assumptions including all-to-all coupling with uniform strength. Real world networks, however, often display heterogeneous connectivity and coupling weights that influence the critical threshold for this transition. We formulate a general mean field theory (Vlasov-Focker Planck equation) for stochastic Kuramoto-type phase oscillator models, valid for coupling graphs/networks with heterogeneous connectivity and coupling strengths, using graphop theory in the mean field limit. Considering symmetric odd-valued coupling functions, we mathematically prove an exact formula for the critical threshold for the incoherence-coherence transition. We numerically test the predicted threshold using large finite-size representations of the network model. For a large class of graph models, we find that the numerical tests agree very well with the predicted threshold obtained from mean field theory. However, the prediction is more difficult in practice for graph structures that are sufficiently sparse. Our findings open future research avenues toward a deeper understanding of mean-field theories for heterogeneous systems.

nlin.AO↗

arXiv2021

Continuum Limits for Adaptive Network Dynamics

Adaptive (or co-evolutionary) network dynamics, i.e., when changes of the network/graph topology are coupled with changes in the node/vertex dynamics, can give rise to rich and complex dynamical behavior. Even though adaptivity can improve the modelling of collective phenomena, it often complicates the analysis of the corresponding mathematical models significantly. For non-adaptive systems, a possible way to tackle this problem is by passing to so-called continuum or mean-field limits, which describe the system in the limit of infinitely many nodes. Although fully adaptive network dynamic models have been used a lot in recent years in applications, we are still lacking a detailed mathematical theory for large-scale adaptive network limits. For example, continuum limits for static or temporal networks are already established in the literature for certain models, yet the continuum limit of fully adaptive networks has been open so far. In this paper we introduce and rigorously justify continuum limits for sequences of adaptive Kuramoto-type network models. The resulting integro-differential equations allow us to incorporate a large class of co-evolving graphs with high density. Furthermore, we use a very general measure-theoretical framework in our proof for representing the (infinite) graph limits, thereby also providing a structural basis to tackle even larger classes of graph limits. As an application of our theory, we consider the continuum limit of an adaptive Kuramoto model directly motivated from neuroscience and studied by Berner et al.~in recent years using numerical techniques and formal stability analysis.

math.DS↗