Related papers: Cluster Synchronization via Graph Laplacian Eigenv…
This article proposes a first analysis of kernel spectral clustering methods in the regime where the dimension $p$ of the data vectors to be clustered and their number $n$ grow large at the same rate. We demonstrate, under a $k$-class…
In this paper, we study cluster synchronization in networks of coupled non-identical dynamical systems. The vertices in the same cluster have the same dynamics of uncoupled node system but the uncoupled node systems in different clusters…
Spectral clustering requires the time-consuming decomposition of the Laplacian matrix of the similarity graph, thus limiting its applicability to large datasets. To improve the efficiency of spectral clustering, a top-down approach was…
The stability (or instability) of synchronization is important in a number of real world systems, including the power grid, the human brain and biological cells. For identical synchronization, the synchronizability of a network, which can…
The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…
Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\emph{motif correlation clustering}, which aims to minimize the cost of clustering errors associated with both edges…
Spectral clustering is one of the most popular clustering methods for finding clusters in a graph, which has found many applications in data mining. However, the input graph in those applications may have many missing edges due to error in…
The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is a NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the…
We study synchronization dynamics in networks of coupled oscillators with bimodal distribution of natural frequencies. This setup can be interpreted as a simple model of frequency synchronization dynamics among generators and loads working…
We investigate the emergence of chimera and cluster states possessing asymmetric dynamics in globally coupled systems, where the trajectories of oscillators belonging to different subpopulations exhibit different dynamical properties. In an…
In a paper by Nishikawa and Motter, a quantity called the normalized spread of the Laplacian eigenvalues is used to measure the synchronizability of certain network dynamics. Through simulations, and without theoretical validation, it is…
By a small-size complex network of coupled chaotic Hindmarsh-Rose circuits, we study experimentally the stability of network synchronization to the removal of shortcut links. It is shown that the removal of a single shortcut link may…
Collective synchronization in complex systems arises from the interplay between topology and dynamics, yet how to design and control such patterns in higher-order networks remains unclear. Here we show that a Dirac spectral programming…
Spectral clustering methods are known for their ability to represent clusters of diverse shapes, densities etc. However, results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to…
The phenomenon of synchronization, where entities exhibit stable oscillations with aligned frequencies and phases, has been detected in diverse areas of natural science. It plays a crucial role in achieving frequency locking in multiple…
Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of…
We suggest an adaptive control scheme for the control of zero-lag and cluster synchronization in delay-coupled networks. Based on the speed-gradient method, our scheme adapts the topology of a network such that the target state is realized.…
This work introduces the phenomenon of Collective Almost Synchronization (CAS), which describes a universal way of how patterns can appear in complex networks even for small coupling strengths. The CAS phenomenon appears due to the…
Adaptive dynamical networks are ubiquitous in real-world systems. This paper aims to explore the synchronization dynamics in networks of adaptive oscillators based on a paradigmatic system of adaptively coupled phase oscillators. Our…
Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large…