Related papers: Eigenvalue Decomposition as a Generalized Synchron…
In the presence of heterogeneous data, where randomly rotated objects fall into multiple underlying categories, it is challenging to simultaneously classify them into clusters and synchronize them based on pairwise relations. This gives…
We develop an Iterative version of the Singular Value Decomposition (ISVD) that jointly analyzes a finite number of data matrices to identify signals that correlate among the rows of matrices. It will be illustrated how the supervised…
We investigate how in complex systems the eigenpairs of the matrices derived from the correlations of multichannel observations reflect the cluster structure of the underlying networks. For this we use daily return data from the NYSE and…
The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.…
We develop a general theoretical framework of semiclassical phase reduction for analyzing synchronization of quantum limit-cycle oscillators. The dynamics of quantum dissipative systems exhibiting limit-cycle oscillations are reduced to a…
We introduce a simple, intuitive and yet powerful algorithm for clustering analysis. This algorithm is an iterative process on the sample space, which arises as an extension of the iteratively generated correlation matrices. It allows for…
Synchronization is a hallmark of collective behavior that emerges when nonlinear systems interact, spanning scales from mechanical oscillators to planetary orbits. As a universal phenomenon it underpins the study of complex systems and has…
In this paper, we introduce an algorithm for performing spectral clustering efficiently. Spectral clustering is a powerful clustering algorithm that suffers from high computational complexity, due to eigen decomposition. In this work, we…
The behavior of weakly coupled self-sustained oscillators can often be well described by phase equations. Here we use the paradigm of Kuramoto phase oscillators which are coupled in a network to calculate first and second order corrections…
This paper develops a closed-form spectral decomposition framework for the Gramian matrices of discrete-time linear dynamical systems. The main results provide explicit decompositions of the discrete-time controllability Gramian and its…
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…
We study synchronization properties of general uncoupled limit-cycle oscillators driven by common and independent Gaussian white noises. Using phase reduction and averaging methods, we analytically derive the stationary distribution of the…
In recent years, spectral clustering has become a standard method for data analysis used in a broad range of applications. In this paper we propose a new class of algorithms for multiway spectral clustering based on optimization of a…
We investigate topological and spectral properties of models of European and US-American power grids and of paradigmatic network models as well as their implications for the synchronization dynamics of phase oscillators with heterogeneous…
Cluster synchronization is a phenomenon in which oscillators in a given network are partitioned into synchronous clusters. As recently shown, diverse cluster synchronization patterns can be found using network symmetry when the oscillators…
This work is devoted to elaboration on the idea to use block term decomposition for group data analysis and to raise the possibility of modelling group activity with (Lr, 1) and Tucker blocks. A new generalization of block tensor…
This paper proposes a new method for similarity analysis and, consequently, a new algorithm for clustering different types of random attributes, both numerical and nominal. However, in order for nominal attributes to be clustered, their…
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides…
The phase reduction method for limit cycle oscillators subjected to weak perturbations has significantly contributed to theoretical investigations of rhythmic phenomena. We here propose a generalized phase reduction method that is also…
We extend classical time-frequency limiting analysis, historically applied to one-dimensional finite signals, to the multidimensional discrete setting. This extension is relevant for images, videos, and other multidimensional signals, as it…