论文信息 - ALGORITHMS FOR FRACTAL DIMENSION CALCULATION

ALGORITHMS FOR FRACTAL DIMENSION CALCULATION

Algorithms to calculate the fractal dimension of a complex network are presented. One of the algorithms is applied to a parametrized class of models whose fractal dimension transitions from one to two. For the system size we considered here (16384 nodes), the transition takes place from one at p = 0 to essentially two at the small value p = 0.03. This seems to indicate that the transition is likely to become infinitely sharp and occur at p = 0 as the system size increases to infinity.

O. Shanker

[1] Jack H. Lutz. Dimension in Complexity Classes , 2003, SIAM J. Comput..

[2] O. Shanker,et al. Graph zeta function and dimension of complex network , 2007 .

[3] Jack H. Lutz,et al. The dimensions of individual strings and sequences , 2002, Inf. Comput..

[4] Jack H. Lutz,et al. Finite-state dimension , 2001, Theor. Comput. Sci..

[5] Ludwig Staiger,et al. A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction , 1998, Theory of Computing Systems.

[6] Jack H. Lutz. Effective fractal dimensions , 2005, Math. Log. Q..

[7] O. Shanker,et al. DEFINING DIMENSION OF A COMPLEX NETWORK , 2007 .

[8] Ludwig Staiger,et al. Kolgomorov Complexity and Hausdorff Dimension , 1993, Inf. Comput..