Graph Clustering Via a Discrete Uncoupling Process (Q3609017)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph Clustering Via a Discrete Uncoupling Process |
scientific article; zbMATH DE number 5524007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Clustering Via a Discrete Uncoupling Process |
scientific article; zbMATH DE number 5524007 |
Statements
Graph Clustering Via a Discrete Uncoupling Process (English)
0 references
6 March 2009
0 references
stochastic uncoupling
0 references
graph clustering
0 references
Markov graph
0 references
Markov matrix
0 references
diagonal similarity
0 references
positive semi-definite matrices
0 references
circulant matrices
0 references
0.7197095155715942
0 references
0.711754322052002
0 references
