Please use this identifier to cite or link to this item:
|Title:||Construction of scale-free networks with adjustable clustering|
|Source:||Proceedings of International Symposium on Nonlinear Theory and Its Applications (NOLTA'2008), Budapest, Hungary, 7-10 September, 2008, p. 257-260 How to cite?|
|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.|
|Appears in Collections:||Conference Paper|
Show full item record
Checked on Jan 22, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.