Related papers: Graphop Mean-Field Limits for Kuramoto-Type Models

Collective oscillations and patterns of synchrony have long fascinated researchers in the applied sciences, particularly due to their far-reaching importance in chemistry, physics, and biology. The Kuramoto model has emerged as a…

Many real-world phenomena can be modelled as dynamical processes on networks, a prominent example being the spread of infectious diseases such as COVID-19. Mean-field approximations are a widely used tool to analyse such dynamical processes…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

We consider the graphon mean-field system introduced in the work of Bayraktar, Chakraborty, and Wu. It is the large-population limit of a heterogeneously interacting diffusive particle system, where the interaction is of mean-field type…

Employing the Kuramoto model as an illustrative example, we show how the use of the mean field approximation can be applied to large networks of phase oscillators with assortativity. We then use the ansatz of Ott and Antonsen [Chaos 19,…

We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…

Can graph neural networks generalize to graphs that are different from the graphs they were trained on, e.g., in size? In this work, we study this question from a theoretical perspective. While recent work established such transferability…

This paper studies stochastic games on large graphs and their graphon limits. We propose a new formulation of graphon games based on a single typical player's label-state distribution. In contrast, other recently proposed models of graphon…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbol{\theta}) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(\theta_i-\theta_j)\bigr).$ A fundamental question is to…

The Kuramoto model is a classical mathematical model in the field of non-linear dynamical systems that describes the evolution of coupled oscillators in a network that may reach a synchronous state. The relationship between the network's…

We propose the Kuramoto Graph Neural Network (KuramotoGNN), a novel class of continuous-depth graph neural networks (GNNs) that employs the Kuramoto model to mitigate the over-smoothing phenomenon, in which node features in GNNs become…

Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…

Generalization and approximation capabilities of message passing graph neural networks (MPNNs) are often studied by defining a compact metric on a space of input graphs under which MPNNs are H\"older continuous. Such analyses are of two…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

In this work, a novel approach for the reliable and efficient numerical integration of the Kuramoto model on graphs is studied. For this purpose, the notion of order parameters is revisited for the classical Kuramoto model describing…

In his classical work on synchronization, Kuramoto derived the formula for the critical value of the coupling strength corresponding to the transition to synchrony in large ensembles of all-to-all coupled phase oscillators with randomly…

The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…

Graphons are limit objects of sequences of graphs and are used to analyze the behavior of large graphs. Recently, graphon signal processing has been developed to study signal processing on large graphs. A major limitation of this approach…

We study Markov processes on weighted directed hypergraphs where the state of at most one vertex can change at a time. Our setting is general enough to include simplicial epidemic processes, processes on multilayered networks or even the…