Spectral Partitioning of Random Graphs with Given Expected Degrees - Detailed Version
It is a well established fact, that – in the case of classical random graphs like variants of Gn,p or random regular graphs – spectral methods yield efficient algorithms for clustering (e. g. colouring or bisec- tion) problems. The theory of large networks emerging recently provides convincing evide...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Universitätsbibliothek Chemnitz
2009
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200900426 http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200900426 http://www.qucosa.de/fileadmin/data/qucosa/documents/5764/data/IB-2009-01-komplett.pdf http://www.qucosa.de/fileadmin/data/qucosa/documents/5764/20090042.txt |