Results 31 to 40 of about 120,979 (218)
Incremental eigenpair computation for graph Laplacian matrices: theory and applications [PDF]
, 2017 The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications, the number of clusters or communities (say,
Al Hasan, Mohammad +2 more
core +2 more sources
Generalized Fuzzy Torus and its Modular Properties [PDF]
, 2013 We consider a generalization of the basic fuzzy torus to a fuzzy torus with non-trivial modular parameter, based on a finite matrix algebra. We discuss the modular properties of this fuzzy torus, and compute the matrix Laplacian for a scalar field.
Schreivogl, Paul, Steinacker, Harold
core +3 more sources
Spectral properties of edge Laplacian matrix
, 2023 Let $N(X)$ be the Laplacian matrix of a directed graph obtained from the edge adjacency matrix of a graph $X.$ In this work, we study the bipartiteness property of the graph with the help of $N(X).$ We computed the spectrum of the edge Laplacian matrix for the regular graphs, the complete bipartite graphs, and the trees.
Chauhan, Shivani +1 more
openaire +3 more sources
Simplicial matrix-tree theorems [PDF]
, 2008 We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai.
Duval, Art M. +2 more
core +5 more sources
On graphs with a few distinct reciprocal distance Laplacian eigenvalues
AIMS Mathematics, 2023 For a $ \nu $-vertex connected graph $ \Gamma $, we consider the reciprocal distance Laplacian matrix defined as $ RD^L(\Gamma) = RT(\Gamma)-RD(\Gamma) $, i.e., $ RD^L(\Gamma) $ is the difference between the diagonal matrix of the reciprocal distance ...
Milica Anđelić +2 more
doaj +1 more source
Diffusion dynamics on multiplex networks [PDF]
, 2012 We study the time scales associated to diffusion processes that take place on multiplex networks, i.e. on a set of networks linked through interconnected layers.
A. Arenas +8 more
core +3 more sources
More on Spectral Analysis of Signed Networks
Complexity, 2018 Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity
Guihai Yu, Hui Qu
doaj +1 more source
A special class of triple starlike trees characterized by Laplacian spectrum
AIMS Mathematics, 2021 Two graphs are said to be cospectral with respect to the Laplacian matrix if they have the same Laplacian spectrum. A graph is said to be determined by the Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum.
10.3934/math.2021260 +4 more
doaj +1 more source
Estimating mixed-memberships using the symmetric laplacian inverse matrix
Journal of the Korean Statistical Society, 2022 Mixed membership community detection is a challenging problem. In this paper, to detect mixed memberships, we propose a new method Mixed-SLIM which is a spectral clustering method on the symmetrized Laplacian inverse matrix under the degree-corrected mixed membership model.
Huan Qing, Jingli Wang
openaire +2 more sources
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source