arXiv (All)
open access
Hierarchical Clustering and Signal Denoising on Digraphs
In this paper, we propose a representation of a digraph (directed graph) as a Hermitian matrix derived from its adjacency matrix. This representation characterizes both the connectivity and the edge orientation of the digraph. Based on the spectral decomposition of the Hermitian matrix, a digraph cl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Iterative Method with Asymptotic Orthogonality for Simultaneous Eigenpair Computation#925887
- Graph-based prototype inverse-projection for identifying cortical sulcal pattern abnormalities in congenital heart disease.#148285
- Breaking the denoising dilemma in NMR spectroscopy by blind source separation.#423130
- Bayesian Matrix-Valued Graphs for Context-Dependent Multivariate Relationships#985448
- Perron similarities and the nonnegative inverse eigenvalue problem#609751
Record · ID 1128929
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive