Coarse graining of complex networks: A k-means clustering approach

Shuang Xu, Pei Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

Complex networks have been at the forefront of scientific research for more than a decade. A big challenge in complex networks is the share size of the considered systems, especially with the arriving of the era of big data. Coarse graining of complex networks is a possible way to overcome such difficulty. This paper tries to develop a new coarse graining method for complex networks, which is based on the well-known k-means clustering technique. Investigations on some artificial complex networks indicate that the proposed method can significantly reduce the network size and complication, meanwhile, some properties of the considered networks can be preserved to some extent. Moreover, the proposed algorithm allows people to freely choose the sizes of the reduced networks. The associated investigations have potential implications in the analysis and control of large-scale complex networks.

Original languageEnglish
Title of host publicationProceedings of the 28th Chinese Control and Decision Conference, CCDC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4113-4118
Number of pages6
ISBN (Electronic)9781467397148
DOIs
StatePublished - 3 Aug 2016
Externally publishedYes
Event28th Chinese Control and Decision Conference, CCDC 2016 - Yinchuan, China
Duration: 28 May 201630 May 2016

Publication series

NameProceedings of the 28th Chinese Control and Decision Conference, CCDC 2016

Conference

Conference28th Chinese Control and Decision Conference, CCDC 2016
Country/TerritoryChina
CityYinchuan
Period28/05/1630/05/16

Keywords

  • Coarse Graining
  • Complex Network
  • k-means Clustering
  • Topological Structure

Fingerprint

Dive into the research topics of 'Coarse graining of complex networks: A k-means clustering approach'. Together they form a unique fingerprint.

Cite this