Status : Verified
| Personal Name | Beltran, Jerome Cary B. |
|---|---|
| Resource Title | A spectral method for detecting core-periphery structure in graphs |
| Date Issued | 10 March 2025 |
| Abstract | Core-periphery structure is a mesoscale structure that has been observed in realworld networks, composed of a densely connected set of core nodes, with a sparsely connected set of periphery nodes. Variants such as multiple core-periphery pairs or multicore-periphery have been proposed to capture different structures in real-world networks, and several methods have also been proposed to detect these different structures. Cucuringu et al. proposed a single core-periphery detection method LOWRANK-CORE that uses a low-rank matrix approximation of the adjacency matrix of a graph. This study aims to develop an algorithm capable of detecting coreperiphery structure in graphs, motivated by the LOWRANK-CORE algorithm, but is based on a different observation, specifically the characteristic polynomial of the adjacency matrix of ideal single core-periphery and multiple core-periphery models. |
| Degree Course | Master of Science in Computer Science |
| Language | English |
| Keyword | core-periphery structure, spectral methods, eigenvalues |
| Material Type | Thesis/Dissertation |
Preliminary Pages
6.17 Mb
Category : F - Regular work, i.e., it has no patentable invention or creation, the author does not wish for personal publication, there is no confidential information.
Access Permission : Open Access