Related papers: The continuum limit of the Kuramoto model on spars…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
The Kuramoto model describes a system of globally coupled phase-only oscillators with distributed natural frequencies. The model in the steady state exhibits a phase transition as a function of the coupling strength, between a low-coupling…
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…
We present a general theory for the onset of coherence in collections of heterogeneous maps interacting via a complex connection network. Our method allows the dynamics of the individual uncoupled systems to be either chaotic or periodic,…
This paper introduces sparse dynamic chain graph models for network inference in high dimensional non-Gaussian time series data. The proposed method parametrized by a precision matrix that encodes the intra time-slice conditional…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said…
In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to such random scenarios. Provided that an ergodicity notion,…
The paper is devoted to the problem of establishing right-convergence of sparse random graphs. This concerns the convergence of the logarithm of number of homomorphisms from graphs or hyper-graphs $\G_N, N\ge 1$ to some target graph $W$.…
Recent work has introduced sparse exchangeable graphs and the associated graphex framework, as a generalization of dense exchangeable graphs and the associated graphon framework. The development of this subject involves the interplay…
We consider the empirical neighborhood distribution of marked sparse Erd\"os-R\'enyi random graphs, obtained by decorating edges and vertices of a sparse Erd\"os-R\'enyi random graph with i.i.d.\ random elements taking values on Polish…
In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…
A modified Kuramoto model of synchronization in a finite discrete system of locally coupled oscillators is studied. The model consists of N oscillators with random natural frequencies arranged on a ring. It is shown analytically and…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
Kuramoto model is one of the most prominent models for the synchronization of coupled oscillators. It has long been a research hotspot to understand how natural frequencies, the interaction between oscillators, and network topology…
In this paper we address two questions about the synchronization of coupled oscillators in the Kuramoto model with all-to-all coupling. In the first part we use some classical results in convex geometry to prove bounds on the size of the…
Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost…
There are a number of models of coupled oscillator networks where the question of the stability of fixed points reduces to calculating the index of a graph Laplacian. Some examples of such models include the Kuramoto and Kuramoto--Sakaguchi…
Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to…
The Kuramoto model with higher-order interactions has recently been shown to exhibit bistability, explosive synchronization transitions, and rich collective dynamics. Existing analytical approaches, however, typically rely on all-to-all…