Search Results (21)

For network graphs, numerous graph features are intimately linked to eigenvalues of the Laplacian matrix, such as connectivity and diameter. Thus, it is very important to solve eigenvalues of the Laplacian matrix for graphs. Similarly, for higher-order networks, eigenvalues of combinatorial Laplacian matrices are also important for invariants of graphs. However, for large-scale networks, it is difficult to calculate eigenvalues of the Laplacian matrix directly because it is either very difficult to obtain the whole network structure or requires a lot of computing resources. Therefore, this article makes the following contributions. Firstly, this paper proposes a random walk approach for estimating the bounds of the greatest eigenvalues of Laplacian matrices for large-scale networks. Considering the relationship between the spectral moments of the adjacency matrix and the closed paths in the network, we utilize the relationship between the adjacency matrix and the Laplacian matrix to establish the relationship between the Laplacian matrix and the closed paths. Then, we employ equiprobable random walks to sample the large graph to obtain the small graph. Through algebraic topology knowledge, we obtain the bounds of the largest eigenvalue of the Laplacian matrix of the large graph by using Laplacian spectral moments of the small graph. Secondly, for high-order networks, this paper proposes a method based on random walks and graph transformations. The graph transformation we propose mainly converts graphs with second-order simplices into ordinary weighted graphs, thereby transforming the problem of solving the spectral moments of the second-order combined Laplacian matrix into solving the spectral moments of the adjacency matrix. Then, we use the aforementioned random walk method to solve bounds of the greatest eigenvalue of the second-order combinatorial Laplacian matrix. Finally, by comparing the proposed method with existing algorithms in synthetic and real networks, its accuracy and superiority are demonstrated. Full article

In practical application, the gathered multi-view data typically misses samples, known as incomplete multi-view data. Most existing incomplete multi-view clustering methods obtain consensus information in multi-view data by completing incomplete data using zero, mean values, etc. These approaches often ignore the higher-order relationship and structural information between different views. To alleviate the above problems, we propose enhanced tensor incomplete multi-view clustering with dual adaptive weight (ETIMC), which can acquire the higher-order relationship, and structural information between multiple perspectives, adaptively recover the missing samples and distinguish the contribution degree of different views. Specifically, the embedded representations obtained from incomplete multi-view data are stacked into a third-order tensor to capture the higher-order relationship. Then, a consensus matrix can be drawn from these potential representations via a self-weighting mechanism. Additionally, we adaptively reconstruct the missing samples while capturing structural information by the hypergraph Laplacian item. Moreover, we integrate the embedded representation of each view, tensor constraints, hypergraph Laplacian regularization, and dual adaptive weighted mechanisms into a unified framework. Experimental results on natural and synthetic incomplete datasets show the superiority of ETIMC. Full article

In recent years, remarkable advancements have been achieved in hyperspectral unmixing (HU). Sparse unmixing, in which models mix pixels as linear combinations of endmembers and their corresponding fractional abundances, has become a dominant paradigm in hyperspectral image analysis. To address the inherent limitations of spectral-only approaches, spatial contextual information has been integrated into unmixing. In this article, a superpixel collaborative sparse unmixing algorithm with graph differential operator (SCSU–GDO), is proposed, which effectively integrates superpixel-based local collaboration with graph differential spatial regularization. The proposed algorithm contains three key steps. First, superpixel segmentation partitions the hyperspectral image into homogeneous regions, leveraging boundary information to preserve structural coherence. Subsequently, a local collaborative weighted sparse regression model is formulated to jointly enforce data fidelity and sparsity constraints on abundance estimation. Finally, to enhance spatial consistency, the Laplacian matrix derived from graph learning is decomposed into a graph differential operator, adaptively capturing local smoothness and structural discontinuities within the image. Comprehensive experiments on three datasets prove the accuracy, robustness, and practical efficacy of the proposed method. Full article

As an extension of non-negative matrix factorization (NMF), graph-regularized non-negative matrix factorization (GNMF) has been widely applied in data mining and machine learning, particularly for tasks such as clustering and feature selection. Traditional GNMF methods typically rely on predefined graph structures to guide the decomposition process, using fixed data graphs and feature graphs to capture relationships between data points and features. However, these fixed graphs may limit the model’s expressiveness. Additionally, many NMF variants face challenges when dealing with complex data distributions and are vulnerable to noise and outliers. To overcome these challenges, we propose a novel method called sparse feature-weighted double Laplacian rank constraint non-negative matrix factorization (SFLRNMF), along with its extended version, SFLRNMTF. These methods adaptively construct more accurate data similarity and feature similarity graphs, while imposing rank constraints on the Laplacian matrices of these graphs. This rank constraint ensures that the resulting matrix ranks reflect the true number of clusters, thereby improving clustering performance. Moreover, we introduce a feature weighting matrix into the original data matrix to reduce the influence of irrelevant features and apply an $L_{\mathrm{2,1}/2}$ norm sparsity constraint in the basis matrix to encourage sparse representations. An orthogonal constraint is also enforced on the coefficient matrix to ensure interpretability of the dimensionality reduction results. In the extended model (SFLRNMTF), we introduce a double orthogonal constraint on the basis matrix and coefficient matrix to enhance the uniqueness and interpretability of the decomposition, thereby facilitating clearer clustering results for both rows and columns. However, enforcing double orthogonal constraints can reduce approximation accuracy, especially with low-rank matrices, as it restricts the model’s flexibility. To address this limitation, we introduce an additional factor matrix R, which acts as an adaptive component that balances the trade-off between constraint enforcement and approximation accuracy. This adjustment allows the model to achieve greater representational flexibility, improving reconstruction accuracy while preserving the interpretability and clustering clarity provided by the double orthogonality constraints. Consequently, the SFLRNMTF approach becomes more robust in capturing data patterns and achieving high-quality clustering results in complex datasets. We also propose an efficient alternating iterative update algorithm to optimize the proposed model and provide a theoretical analysis of its performance. Clustering results on four benchmark datasets demonstrate that our method outperforms competing approaches. Full article

This paper provides an efficient method to compute an $LDU$ decomposition of the Laplacian matrix of a connected graph with high relative accuracy. Several applications of this method are presented. In particular, it can be applied to efficiently compute the eigenvalues of the mentioned Laplacian matrix. Moreover, the method can be extended to graphs with weighted edges. Full article

This paper investigates the long-time behavior of fractional-order complex memristive neural networks in order to analyze the synchronization of both anatomical and functional brain networks, for predicting therapy response, and ensuring safe diagnostic and treatments of neurological disorder (such as epilepsy, Alzheimer’s disease, or Parkinson’s disease). A new mathematical brain connectivity model, taking into account the memory characteristics of neurons and their past history, the heterogeneity of brain tissue, and the local anisotropy of cell diffusion, is proposed. This developed model, which depends on topology, interactions, and local dynamics, is a set of coupled nonlinear Caputo fractional reaction–diffusion equations, in the shape of a fractional-order ODE coupled with a set of time fractional-order PDEs, interacting via an asymmetric complex network. In order to introduce into the model the connection structure between neurons (or brain regions), the graph theory, in which the discrete Laplacian matrix of the communication graph plays a fundamental role, is considered. The existence of an absorbing set in state spaces for system is discussed, and then the dissipative dynamics result, with absorbing sets, is proved. Finally, some Mittag–Leffler synchronization results are established for this complex memristive neural network under certain threshold values of coupling forces, memristive weight coefficients, and diffusion coefficients. Full article

In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the local and global properties of a complex graph structure within computer vision applications. However, with increasing graph nodes, the Laplacian matrix’s dimensionality also increases accordingly. Therefore, there is always the “curse of dimensionality”; In response to this challenge, this paper introduces a new approach to reducing the dimensionality of the weighted Laplacian matrix by utilizing the Gershgorin circle theorem by transforming the weighted Laplacian matrix into a strictly diagonal domain and then estimating rough eigenvalue inclusion of a matrix. The estimated inclusions are represented as reduced features, termed GC features; The proposed Gershgorin circle feature extraction (GCFE) method was evaluated using three publicly accessible computer vision datasets, varying image patch sizes, and three different graph types. The GCFE method was compared with eight distinct studies. The GCFE demonstrated a notable positive Z-score compared to other feature extraction methods such as I-PCA, kernel PCA, and spectral embedding. Specifically, it achieved an average Z-score of 6.953 with the 2D grid graph type and 4.473 with the pairwise graph type, particularly on the E_Balanced dataset. Furthermore, it was observed that while the accuracy of most major feature extraction methods declined with smaller image patch sizes, the GCFE maintained consistent accuracy across all tested image patch sizes. When the GCFE method was applied to the E_MNSIT dataset using the K-NN graph type, the GCFE method confirmed its consistent accuracy performance, evidenced by a low standard deviation (SD) of 0.305. This performance was notably lower compared to other methods like Isomap, which had an SD of 1.665, and LLE, which had an SD of 1.325; The GCFE outperformed most feature extraction methods in terms of classification accuracy and computational efficiency. The GCFE method also requires fewer training parameters for deep-learning models than the traditional weighted Laplacian method, establishing its potential for more effective and efficient feature extraction in computer vision tasks. Full article

Controllability is a fundamental issue in the field of fractional complex network control, yet it has not received adequate attention in the past. This paper is dedicated to exploring the controllability of complex networks involving the Caputo fractional derivative. By utilizing the Cayley–Hamilton theorem and Laplace transformation, a concise proof is given to determine the controllability of linear fractional complex networks. Subsequently, leveraging the Schauder Fixed-Point theorem, controllability Gramian matrix, and fractional calculus theory, we derive controllability conditions for nonlinear fractional complex networks with a weighted adjacency matrix and Laplacian matrix, respectively. Finally, a numerical method for the controllability of fractional complex networks is obtained using Matlab (2021a)/Simulink (2021a). Three examples are provided to illustrate the theoretical results. Full article

This paper proposes a spectral clustering method using k-means and weighted Mahalanobis distance (Referred to as MDLSC) to enhance the degree of correlation between data points and improve the clustering accuracy of Laplacian matrix eigenvectors. First, we used the correlation coefficient as the weight of the Mahalanobis distance to calculate the weighted Mahalanobis distance between any two data points and constructed the weighted Mahalanobis distance matrix of the data set; then, based on the weighted Mahalanobis distance matrix, we used the K-nearest neighborhood (KNN) algorithm construct similarity matrix. Secondly, the regularized Laplacian matrix was calculated according to the similarity matrix, normalized and decomposed, and the feature space for clustering was obtained. This method fully considered the degree of linear correlation between data and special spatial structure and achieved accurate clustering. Finally, various spectral clustering algorithms were used to conduct multi-angle comparative experiments on artificial and UCI data sets. The experimental results show that MDLSC has certain advantages in each clustering index and the clustering quality is better. The distribution results of the eigenvectors also show that the similarity matrix calculated by MDLSC is more reasonable, and the calculation of the eigenvectors of the Laplacian matrix maximizes the retention of the distribution characteristics of the original data, thereby improving the accuracy of the clustering algorithm. Full article

This paper studies the consensus of first-order discrete-time multi-agent systems with fixed and switching topology, and there exists cooperative and antagonistic interactions among agents. A signed graph is used to model the interactions among agents, and some sufficient conditions for consensus are obtained by analyzing the eigenvalues of a Laplacian matrix in the case of fixed topology. The results indicate that having a spanning tree is only a necessary condition for the consensus of multi-agent systems with signed graphs, which is also affected by edge weights. Consensus is further discussed in the case of switching topology, and the results reveal that consensus can be reached if the controller gain and the union graphs among some consecutive time intervals satisfy some conditions. Finally, several simulation examples further confirm the theoretical results. Full article

Description of interacting spin systems relies on understanding the spectral properties of the corresponding spin Hamiltonians. However, the eigenvalue problems arising here lead to algebraic problems too complex to be analytically tractable. This is already the case for the simplest nontrivial $\left(K_{\max }-1\right)$ block for an isotropic hyperfine Hamiltonian for a radical with spin-$\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.$ nuclei, where $n$ nuclei produce an n-th order algebraic equation with n independent parameters. Systems described by such blocks are now physically realizable, e.g., as radicals or radical pairs with polarized nuclear spins, appear as closed subensembles in more general radical settings, and have numerous counterparts in related central spin problems. We provide a simple geometrization of energy levels in this case: given $n$ spin-$\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.$ nuclei with arbitrary positive couplings $a_i,$ take an n-dimensional hyper-ellipsoid with semiaxes $\sqrt{a_i},$ stretch it by a factor of $\sqrt{n+1}$ along the spatial diagonal $\left(1, 1, \dots , 1\right),$ read off the semiaxes of thus produced new hyper-ellipsoid $q_i,$ augment the set $\left\{q_i\right\}$ with $q_0=0,$ and obtain the sought $n+1$ energies as $E_k=-\frac{1}{2}{q}_k^2+\frac{1}{4}{\displaystyle {\sum }_i{a}_i}.$ This procedure provides a way of seeing things that can only be solved numerically, giving a useful tool to gain insights that complement the numeric simulations usually inevitable here, and shows an intriguing connection to discrete Fourier transform and spectral properties of standard graphs. Full article

Spectral techniques are often used to partition the set of vertices of a graph, or to form clusters. They are based on the Laplacian matrix. These techniques allow easily to integrate weights on the edges. In this work, we introduce a p-Laplacian, or a generalized Laplacian matrix with potential, which also allows us to take into account weights on the vertices. These vertex weights are independent of the edge weights. In this way, we can cluster with the importance of vertices, assigning more weight to some vertices than to others, not considering only the number of vertices. We also provide some bounds, similar to those of Chegeer, for the value of the minimal cut cost with weights at the vertices, as a function of the first non-zero eigenvalue of the p-Laplacian (an analog of the Fiedler eigenvalue). Full article

This paper examines the roles of the matrix weight elements in matrix-weighted consensus. The consensus algorithms dictate that all agents reach consensus when the weighted graph is connected. However, it is not always the case for matrix weighted graphs. The conditions leading to different types of consensus have been extensively analysed based on the properties of matrix-weighted Laplacians and graph theoretic methods. However, in practice, there is concern on how to pick matrix-weights to achieve some desired consensus, or how the change of elements in matrix weights affects the consensus algorithm. By selecting the elements in the matrix weights, different clusters may be possible. In this paper, we map the roles of the elements of the matrix weights in the systems consensus algorithm. We explore the choice of matrix weights to achieve different types of consensus and clustering. Our results are demonstrated on a network of three agents where each agent has three states. Full article

This paper focuses on modeling a disordered system of quantum dots (QDs) by using complex networks with spatial and physical-based constraints. The first constraint is that, although QDs (=nodes) are randomly distributed in a metric space, they have to fulfill the condition that there is a minimum inter-dot distance that cannot be violated (to minimize electron localization). The second constraint arises from our process of weighted link formation, which is consistent with the laws of quantum physics and statistics: it not only takes into account the overlap integrals but also Boltzmann factors to include the fact that an electron can hop from one QD to another with a different energy level. Boltzmann factors and coherence naturally arise from the Lindblad master equation. The weighted adjacency matrix leads to a Laplacian matrix and a time evolution operator that allows the computation of the electron probability distribution and quantum transport efficiency. The results suggest that there is an optimal inter-dot distance that helps reduce electron localization in QD clusters and make the wave function better extended. As a potential application, we provide recommendations for improving QD intermediate-band solar cells. Full article

Integrating multigenomic data to recognize cancer subtype is an important task in bioinformatics. In recent years, some multiview clustering algorithms have been proposed and applied to identify cancer subtype. However, these clustering algorithms ignore that each data contributes differently to the clustering results during the fusion process, and they require additional clustering steps to generate the final labels. In this paper, a new one-step method for cancer subtype recognition based on graph learning framework is designed, called Laplacian Rank Constrained Multiview Clustering (LRCMC). LRCMC first forms a graph for a single biological data to reveal the relationship between data points and uses affinity matrix to encode the graph structure. Then, it adds weights to measure the contribution of each graph and finally merges these individual graphs into a consensus graph. In addition, LRCMC constructs the adaptive neighbors to adjust the similarity of sample points, and it uses the rank constraint on the Laplacian matrix to ensure that each graph structure has the same connected components. Experiments on several benchmark datasets and The Cancer Genome Atlas (TCGA) datasets have demonstrated the effectiveness of the proposed algorithm comparing to the state-of-the-art methods. Full article