scholarly journals Tsallis information dimension of complex networks

2015 ◽  
Vol 419 ◽  
pp. 707-717 ◽  
Author(s):  
Qi Zhang ◽  
Chuanhai Luo ◽  
Meizhu Li ◽  
Yong Deng ◽  
Sankaran Mahadevan
2020 ◽  
Vol 132 ◽  
pp. 109590 ◽  
Author(s):  
Aldo Ramirez-Arellano ◽  
Luis Manuel Hernández-Simón ◽  
Juan Bory-Reyes

2020 ◽  
Vol 34 (17) ◽  
pp. 2050189
Author(s):  
Min Niu ◽  
Ruixia Li

Self-similarity is a significant property for complex networks. Box coverage method and dimension calculation are vital tools to study the characteristic of complex networks. In this paper, we propose an outside-in (OSI) box covering method for the Sierpinski networks, and it is attested that this coverage algorithm is superior to CBB algorithm. In addition, we deduce the optimal box recurrence formula of weighted and unweighted networks theoretically, and the result is the same as that of the algorithm value. We also obtain the information dimension of weighted network, which verifies the validity and feasibility of our method.


2014 ◽  
Vol 378 (16-17) ◽  
pp. 1091-1094 ◽  
Author(s):  
Daijun Wei ◽  
Bo Wei ◽  
Yong Hu ◽  
Haixin Zhang ◽  
Yong Deng

Author(s):  
Reuven Cohen ◽  
Shlomo Havlin
Keyword(s):  

2013 ◽  
Vol 22 (2) ◽  
pp. 151-174 ◽  
Author(s):  
Richard Southwell ◽  
Jianwei Huang ◽  
Chris Cannings ◽  
◽  

Sign in / Sign up

Export Citation Format

Share Document