Construction of scale-free networks with adjustable clustering

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

Construction of scale-free networks with adjustable clustering

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

The Hong Kong Polytechnic University

Research output: Unpublished conference presentation (presented paper, abstract, poster) › Conference presentation (not published in journal/proceeding/book) › Academic research › peer-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 language	English
Pages	257-260
Number of pages	4
Publication status	Published - 2008
Event	International Symposium on Nonlinear Theory and Its Applications [NOLTA] - Duration: 1 Jan 2008 → …

Conference

Conference	International Symposium on Nonlinear Theory and Its Applications [NOLTA]
Period	1/01/08 → …

Cite this

@conference{7c6399b1f0d7486a8ccc34c2d1151f60,

title = "Construction of scale-free networks with adjustable clustering",

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.",

author = "W.M. Tam and Lau, {Chung Ming} and Tse, {Chi Kong}",

year = "2008",

language = "English",

pages = "257--260",

note = "International Symposium on Nonlinear Theory and Its Applications [NOLTA] ; Conference date: 01-01-2008",

}

Construction of scale-free networks with adjustable clustering. / Tam, W.M.; Lau, Chung Ming; Tse, Chi Kong.
2008. 257-260 Paper presented at International Symposium on Nonlinear Theory and Its Applications [NOLTA].

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

TY - CONF

T1 - Construction of scale-free networks with adjustable clustering

AU - Tam, W.M.

AU - Lau, Chung Ming

AU - Tse, Chi Kong

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

M3 - Conference presentation (not published in journal/proceeding/book)

SP - 257

EP - 260

T2 - International Symposium on Nonlinear Theory and Its Applications [NOLTA]

Y2 - 1 January 2008

ER -

Construction of scale-free networks with adjustable clustering

Abstract

Conference

Fingerprint

Cite this