Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/27396| Title: | Assortative partitions of complete graphs | Authors: | Zlatanova, Magdalena | Keywords: | Combinatorial optimization, NP class, complete graphs, graph partitioning, statistical physics | Issue Date: | Jul-2023 | Publisher: | Ss Cyril and Methodius University in Skopje, Faculty of Computer Science and Engineering, Republic of North Macedonia | Series/Report no.: | CIIT 2023 papers;21; | Conference: | 20th International Conference on Informatics and Information Technologies - CIIT 2023 | Abstract: | This paper studies the problem of assortative partitions of complete graphs. Assortativity is a measure of the similarity of each node to its neighborhood. The results from numerical simulations suggest that for this class of graphs the assortative partitioning problem becomes more difficult as we increase the assortativity threshold. We observe a significant difference in the performance of the Gradient Descent algorithm when our assortativity threshold is set to 4 instead of 2. This numerically supports the hypothesis that the problem becomes more difficult. | URI: | http://hdl.handle.net/20.500.12188/27396 |
| Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| CIIT2023_paper_21.pdf | 9.18 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.