Related papers: Kuramoto Networks with Infinitely Many Stable Equi…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
The stable roommates problem is a non-bipartite version of the well-known stable matching problem. Teo and Sethuraman proved that, for each instance of the stable roommates problem in a complete graph, there exists a linear inequality…
The following sharpening of Tur\'an's theorem is proved. Let $T_{n,p}$ denote the complete $p$--partite graph of order $n$ having the maximum number of edges. If $G$ is an $n$-vertex $K_{p+1}$-free graph with $e(T_{n,p})-t$ edges then there…
Beginning with the work of Lohe [14,15] there have been a number of papers [3,5,8,9,11] that have generalized the Kuramoto model for phase-locking to a non-commuting situation. Here we propose and analyze another such model. We consider a…
We prove homological stability for sequences of "oriented configuration spaces" as the number of points in the configuration goes to infinity. These are spaces of configurations of n points in a connected manifold M of dimension at least 2…
For any positive integer $k$, we show that every maximal $C_{2k+1}$-free graph with at least $n^2/4-o(n^{3/2})$ edges contains an induced complete bipartite subgraph on $(1-o(1))n$ vertices. We also show that this is best possible.
The Kuramoto model of coupled phase oscillators with inertia on Erdos-Renyi graphs is analyzed in this work. For a system with intrinsic frequencies sampled from a bimodal distribution we identify a variety of two cluster patterns and study…
An $r$-graph is a triangle if there exists a positive integer $i \le \lceil r/2 \rceil$ such that it is isomorphic to the following $r$-graph with three edges: \begin{align*} \left\{\{1, \ldots, r\},~\{1, \ldots, i, r+1, \ldots,…
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…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
The Kuramoto model is a mean-field model for the synchronisation behaviour of oscillators, which exhibits Landau damping. In a recent work, the nonlinear stability of a class of spatially inhomogeneous stationary states was shown under the…
We solve a longstanding stability problem for the Kuramoto model of coupled oscillators. This system has attracted mathematical attention, in part because of its applications in fields ranging from neuroscience to condensed-matter physics,…
The goal of this work is to identify steady-state solutions to dynamical systems defined on large, random families of networks. We do so by passing to a continuum limit where the adjacency matrix is replaced by a non-local operator with…
Based on a local greedy numerical algorithm, we compute the topology of weighted, directed, and of unlimited extension networks of non identical Kuramoto oscillators which simultaneously satisfy 2 criteria: i) global frequency…
We prove a version of the strong Taylor's conjecture for stable graphs: if $G$ is a stable graph whose chromatic number is strictly greater than $\beth_2(\aleph_0)$ then $G$ contains all finite subgraphs of Sh$_n(\omega)$ and thus has…
We study the homogeneous Kuramoto model on a graph and the geometry of its underlying optimization landscape $\min_{\boldsymbol \theta \in \mathbb R^n}-\sum_{1\leq i,j\leq n} A_{ij}\cos(\theta_i-\theta_j).$ This problem admits a dual…
Turan's theorem implies that every graph of order n with more edges than the r-partite Turan graph contains a complete graph of order r+1. We show that the same premise implies the existence of much larger graphs. We also prove…
Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan…
Following the argument for diffeomorphisms by Galatius and Randal-Williams, we prove that homeomorphisms of 1-connected manifolds of even dimension at least 6 exhibit homological stability. We deduce similar results for PL homeomorphisms…
We study the Kuramoto-Sakaguchi (KS) model composed by any N identical phase oscillators symmetrically coupled. Ranging from local (one-to-one, R = 1) to global (all-to-all, R = N/2) couplings, we derive the general solution that describes…