Related papers: Kuramoto Networks with Infinitely Many Stable Equi…
The Kuramoto--Sakaguchi model is a modification of the well-known Kuramoto model that adds a phase-lag paramater, or "frustration" to a network of phase-coupled oscillators. The Kuramoto model is a flow of gradient type, but adding a…
Both the Simonovits stability theorem and the Nikiforov spectral stability theorem are powerful tools for solving exact values of Tur\'{a}n numbers in extremal graph theory. Recently, F\"{u}redi [J. Combin. Theory Ser. B 115 (2015)]…
The Kuramoto-Daido model, which describes synchronization phenomena, is a system of ordinary differential equations on $N$-torus defined as coupled harmonic oscillators, whose natural frequencies are drawn from some distribution function.…
Woodall proved that for a graph $G$ of order $n\geq 2k+3$ where $k\geq 0$ is an integer, if $e(G)\geq \binom{n-k-1}{2}+\binom{k+2}{2}+1$ then $G$ contains a $C_{\ell}$ for each $\ell\in [3,n-k]$. In this article, we prove a stability result…
This paper studies the uniformly asymptotic stability of nonautonomous systems on Riemannian manifolds. We establish corresponding Lyapunov-type theorems (Theorems 2.1 and 2.2), extending classical Euclidean results (e.g., [9, Theorems 4.9…
Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We determine the maximum number of edges of an $n$-vertex graph $G$ with the property that none of its $r$-cliques intersects a fixed set $M\subset V(G)$. For $(r-1)|M|\ge n$, the $(r-1)$-partite Turan graph turns out to be the unique…
The Kuramoto model is a standard model for the dynamics of coupled oscillator networks. In particular, it is used to study long time behavior such as phase-locking where all oscillators rotate at a common frequency with fixed angle…
The aim of this work is to establish a linear instability criterium of stationary solutions for the Korteweg-de Vries model on a star graph with a structure represented by a finite collections of semi-infinite edges. By considering a…
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…
We present the global-in-time existence of strong solutions and its large-time behavior for the Kuramoto-Sakaguchi equation with inertia. The equation describes the evolution of the probability density function for a large ensemble of…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possible approach to this problem based on the concept of a…
We consider a system of random autonomous ODEs introduced by Cugliandolo et al. [22], which serves as a non-relaxational analog of the gradient flow for the spherical p-spin model. The asymptotics for the expected number of equilibria in…
Determining the number of stable phase-locked solutions for locally coupled Kuramoto models is a long-standing mathematical problem with important implications in biology, condensed matter physics and electrical engineering among others. We…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…