Related papers: Threshold graphs are globally synchronizing
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a…
We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\varepsilon$ of edges and $\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\%$ of the possible range…
Networks of Kuramoto oscillators with a positive correlation between the oscillators frequencies and the degree of the their corresponding vertices exhibits the so-called explosive synchronization behavior, which is now under intensive…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
An outerstring graph is the intersection graph of curves lying inside a disk with one endpoint on the boundary of the disk. We show that an outerstring graph with $n$ vertices has treewidth $O(\alpha\log n)$, where $\alpha$ denotes the…
A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
Jamison and Sprague defined a graph $G$ to be a $k$-threshold graph with thresholds $\theta_1 , \ldots, \theta_k$ (strictly increasing) if one can assign real numbers $(r_v)_{v \in V(G)}$, called ranks, such that for every pair of vertices…
Synchronization systems with effective inertia, such as power grid networks and coupled electromechanical oscillators, are commonly modeled by the second-order Kuramoto model. In the forward process, numerical simulations exhibit a…
We study the synchronized behavior of the inertial Kuramoto oscillators with frustration effect under a symmetric and connected network. Due to the lack of second-order gradient flow structure and singularity of second-order derivative of…
In this note we show that for the Kuramoto model defined in a simple undirected graph it is possible to decide which nodes form the core of the network. The set of core-nodes is defined by its relevance to the phase synchronisation process.
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
The multidimensional Kuramoto model describes the synchronization dynamics of particles moving on the surface of D-dimensional spheres, generalizing the original model where particles were characterized by a single phase. In this setup,…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
Partial integrability in phase-oscillator dynamics is typically examined for identically connected oscillators or groups thereof. Yet, the precise connectivity conditions that ensure conserved quantities on general networks remain unclear.…
A graph $G=(V,E)$ is called a \emph{$k$-threshold graph} with \emph{thresholds} $\theta_1<\theta_2<...<\theta_k$ if we can assign a real number $r(v)$ to each vertex $v\in V$, such that for any $u,v\in V$, we have $uv\in E$ if and only if…
The recently established threshold theorem for energy critical wave maps states that wave maps with energy less than that of the ground state (i.e., a minimal energy nontrivial harmonic map) are globally regular and scatter on…
One of the simplest mathematical models in the study of nonlinear systems is the Kuramoto model, which describes synchronization in systems from swarms of insects to superconductors. We have recently found a connection between the original,…
We consider the problem of tensor completion with graphs serving as side information to represent interrelationships among variables. Existing approaches suffer from several limitations: (1) they are often task-specific and lack generality…