Graph Clustering Via a Discrete Uncoupling Process

DOI10.1137/040608635MaRDI QIDQ3609017zbMATH OpenOpenAlexFDO

Authors Stijn van Dongen

Publication date 6 March 2009

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/53f31f82557d66b6de06ed749f426f49a78d5435

zbMATH Keywords

circulant matricesdiagonal similaritygraph clusteringMarkov graphMarkov matrixpositive semi-definite matricesstochastic uncoupling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Random matrices (algebraic aspects) (15B52) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 6263207
• scientific article; zbMATH DE number 2081091
• scientific article; zbMATH DE number 7233060
• Clusters in Markov chains via singular vectors of Laplacian matrices
• Spectral clustering and its use in bioinformatics

Cited in

(7)

• ViennaCL-linear algebra library for multi- and many-core architectures
• Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
• Multi-level spectral graph partitioning method
• Information dynamics algorithm for detecting communities in networks
• The parallelism motifs of genomic data analysis
• scientific article; zbMATH DE number 6781370 (Why is no real title available?)
• Identifying well-connected communities in real-world and synthetic networks

This page was built for publication: Graph Clustering Via a Discrete Uncoupling Process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609017)