Non-Homogeneous Fractal Hierarchical Weighted Networks
نویسندگان
چکیده
A model of fractal hierarchical structures that share the property of non-homogeneous weighted networks is introduced. These networks can be completely and analytically characterized in terms of the involved parameters, i.e., the size of the original graph Nk and the non-homogeneous weight scaling factors r1, r2, · · · rM. We also study the average weighted shortest path (AWSP), the average degree and the average node strength, taking place on the non-homogeneous hierarchical weighted networks. Moreover the AWSP is scrupulously calculated. We show that the AWSP depends on the number of copies and the sum of all non-homogeneous weight scaling factors in the infinite network order limit.
منابع مشابه
A dynamical approach to a self-similar universe
We write a non-relativistic Lagrangian for a hierarchical universe. The equations of motion are solved numerically and the evolution of the fractal dimension is obtained for different initial conditions. We show that our model is homogeneous at the time of the last scattering, but evolves into a self-similar universe with a remarkably constant fractal dimension. We also show that the Hubble law...
متن کاملMultifractal analysis of weighted networks by a modified sandbox algorithm
Complex networks have attracted growing attention in many fields. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. Some algorithms for MFA of unweighted complex networks have been proposed in the past a few years, including the sandbox (SB) algorithm re...
متن کاملBox-covering algorithm for fractal dimension of weighted networks.
Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box size length is obtained by accumulating the distance between two nodes connected directly and gra...
متن کاملSpectral dimensions of hierarchical scale-free networks with weighted shortcuts.
Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfra...
متن کاملSelf-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
In this paper, firstly, we study analytically the topological features of a family of hierarchical lattices (HLs) from the view point of complex networks. We derive some basic properties of HLs controlled by a parameter q: scale-free degree distribution with exponent γ = 2+ ln 2 ln q , null clustering coefficient, power-law behavior of grid coefficient, exponential growth of average path length...
متن کامل