Using local link switching algorithm to control directed and weight network clustering coefficient
碩士 === 淡江大學 === 資訊工程學系碩士班 === 98 === Over the past decade the studies of complex networks have been analyzed and researched. In analyzing Clustering coefficient is a important concept Clustering coefficient characterizes the relative tightness of a network and is a defining network statistics that a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94797731947635120347 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士班 === 98 === Over the past decade the studies of complex networks have been analyzed and researched. In analyzing Clustering coefficient is a important concept Clustering coefficient characterizes the relative tightness of a network and is a defining network statistics that appears in many “real-world” network data.
This paper proposed a local link switching algorithm which effectively increases the clustering coefficient of a directed weight network while preserving the network node degree distributions. This link switching algorithm is based on local neighborhood information. Link switching algorithm is widely used in producing similar networks with the same degree distribution, that is, it is used in ‘sampling’ networks from the same network pool. How to use this algorithm to implement in directed and weight network is major study in this paper.
|
|---|