Related papers: Kuramoto Networks with Infinitely Many Stable Equi…
We present and analyze a nonabelian version of the Kuramoto system, which we call the quantum Kuramoto system. We study the stability of several classes of special solutions to this system, and show that for certain connection topologies…
Phase balanced states are a highly under-explored class of solutions of the Kuramoto model and other coupled oscillator models on networks. So far, coupled oscillator research focused on phase synchronized solutions. Yet, global constraints…
The Kuramoto model of coupled phase oscillators is often used to describe synchronization phenomena in nature. Some applications, e.g., quantum synchronization and rigid-body attitude synchronization, involve high-dimensional Kuramoto…
In this paper we investigate equilibria of continuous differential equation models of network dynamics. The motivation comes from gene regulatory networks where each directed edge represents either down- or up-regulation, and is modeled by…
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We show that a projective manifold is stable if and only if the Mabuchi energy is proper on the space of algebraic metrics. We show that stability implies finite automorphism group.
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…
A well-known property of unordered configuration spaces of points (in an open, connected manifold) is that their homology stabilises as the number of points increases. We generalise this result to moduli spaces of submanifolds of higher…
The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same size. G is a Koenig-Egervary graph if its order equals…
In view of highly decentralized and diversified power generation concepts, in particular with renewable energies such as wind and solar power, the analysis and control of the stability and the synchronization of power networks is an…
The Kuramoto model is fundamental to the study of synchronization. It consists of a collection of oscillators with interactions given by a network, which we identify respectively with vertices and edges of a graph. In this paper, we show…
Given a graph $F$, a hypergraph is called a Berge-$F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k$. Kang, Ni, and Shan [12] determined the Tur\'an number of…
In his classical work, Kuramoto analytically described the onset of synchronization in all-to-all coupled networks of phase oscillators with random intrinsic frequencies. Specifically, he identified a critical value of the coupling…
For any smooth compact manifold $W$ of dimension at least two we prove that the classifying spaces of its group of diffeomorphisms which fix a set of $k$ points or $k$ embedded disks (up to permutation) satisfy homology stability. The same…
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph $G = (A \cup B, E)$, with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good…
We construct infinite families of topologically isotopic but smoothly distinct knotted spheres in many simply connected 4-manifolds that become smoothly isotopic after stabilizing by connected summing with $S^2 \times S^2$, and as a…
In our previous work [Chiba, Medvedev, arXiv:1612.06493], we initiated a mathematical investigation of the onset of synchronization in the Kuramoto model (KM) of coupled phase oscillators on convergent graph sequences. There, we derived and…