A new information dimension of complex networks |
| |
| Institution: | 1. School of Computer and Information Science, Southwest University, Chongqing 400715, China;2. School of Science, Hubei University for Nationalities, Enshi 445000, China;3. Institute of Business Intelligence and Knowledge Discovery, Guangdong University of Foreign Studies, Guangzhou 510006, China;4. School of Engineering, Vanderbilt University, TN 37235, USA |
| |
| Abstract: | The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks. |
| |
| Keywords: | Fractal Self-similarity Information dimension Complex networks |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
