Search
2 articles for “laplacian”
-
Spectral Intuitionistic Fuzzy Hypergraph Operators and Dominance Kernels for Resilient Discrete Network Design
Abstract: A new discrete-mathematical framework is developed for resilient network design on intuitionistic fuzzy hypergraphs, where uncertainty is explicitly represented through membership, non-membership, and hesitation degrees associated with both vertices and hyperedges. These three components are systematically integrated into an effective incidence operator that captures the underlying uncertain relationships within complex hypergraph structures. Based on this operator, both un-normalised and normalized Laplacian matrices are formulated to characterize the spectral properties and …
Published in Recent Trends in Mathematics · Vol. 3, Issue 2, 2026 · pp. 41–48 Read article
-
Intrinsic Evaluation of Graph Embeddings: Assessing Clustering and Community Detection Performance
Abstract: This paper presents an intrinsic evaluation of some graph embedding techniques on clustering and community detection tasks. We analyze a diverse set of embedding methods, ranging from traditional techniques such as Laplacian eigenmaps to more recent approaches like graph autoencoders, high-order proximity preserved embedding (HOPE), and graph attention network (GAT), using two widely studied datasets, Cora and CiteSeer. Our evaluation relies on two main metrics: Silhouette score with respect to …
Published in International Journal of Algorithms Design and Analysis Review · Vol. 3, Issue 1, 2025 · pp. 40–48 Read article