Construction of scale-free networks with adjustable clustering

W.M. Tam, Chung Ming Lau, Chi Kong Tse

Research output: Unpublished conference presentation (presented paper, abstract, poster)Conference presentation (not published in journal/proceeding/book)Academic researchpeer-review

Abstract

A complex network is characterized by its degree distribution and clustering coefficient. Given a scale-free network, we propose a node-reconnection algorithm that can alter the clustering coefficient of the network while keeping the degree of each node unchanged. Results are shown when the algorithm is applied to reconnect the nodes of scale-free networks constructed using the Barabasi-Albert (BA) model.
Original languageEnglish
Pages257-260
Number of pages4
Publication statusPublished - 2008
EventInternational Symposium on Nonlinear Theory and Its Applications [NOLTA] -
Duration: 1 Jan 2008 → …

Conference

ConferenceInternational Symposium on Nonlinear Theory and Its Applications [NOLTA]
Period1/01/08 → …

Cite this