Multifractal analysis of complex networks

Complex networks have recently attracted much attention in diverse areas of science and technology.Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions.Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns.In this paper,we introduce a new box-covering algorithm for multifractal analysis of complex networks.This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks,namely scale-free networks,small world networks,and random networks,and one kind of real network,namely protein-protein interaction networks of different species.Our numerical results indicate the existence of multifractality in scale-free networks and protein-protein interaction networks,while the multifractal behavior is not clear-cut for small world networks and random networks.The possible variation of D q due to changes in the parametersof the theoretical network models is also discussed.     

Weighted Fractal Networks

In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension. General networks with fractal or hierarchical structures can be set in the proposed framework that moreover could be used to provide some answers to the widespread emergence of fractal structures in nature.     

A new information dimension of complex networks

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.     

An Extended Correlation Dimension of Complex Networks

Fractal and self-similarity are important characteristics of complex networks. The correlation dimension is one of the measures implemented to characterize the fractal nature of unweighted structures, but it has not been extended to weighted networks. In this paper, the correlation dimension is extended to the weighted networks. The proposed method uses edge-weights accumulation to obtain scale distances. It can be used not only for weighted networks but also for unweighted networks. We selected six weighted networks, including two synthetic fractal networks and four real-world networks, to validate it. The results show that the proposed method was effective for the fractal scaling analysis of weighted complex networks. Meanwhile, this method was used to analyze the fractal properties of the Newman–Watts (NW) unweighted small-world networks. Compared with other fractal dimensions, the correlation dimension is more suitable for the quantitative analysis of small-world effects.     

Emergence of complex networks from diffusion on fractal lattices. A special case of the Sierpinski gasket and tetrahedron

A new approach to the assemblage of complex networks displaying the scale-free architecture is proposed. While the growth and the preferential attachment of incoming nodes assure an emergence of such networks according to the Barabási–Albert model, it is argued here that the preferential linking condition needs not to be a principal rule. To assert this statement a simple computer model based on random walks on fractal lattices is introduced. It is shown that the model successfully reproduces the degree distributions, the ultra-small-worldness and the high clustering arising from the topology of scale-free networks.     

Effects of Different Connectivity Topologies in Small World Networks on EEG-Like Activities

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the effects of different connectivity topologies on complex behavior of electroencephalographic-like signals produced by this model. We show that several times series analysis methods that are often used for analyzing complex behavior of electroencephalographic-like signals, such as reconstruction of the phase space, correlation dimension, fractal dimension, and the Hurst exponent within the rescaled range analysis (R/S). We find that the different connectivity topologies lead to different dynamical behaviors in models of integrate-and-fire neurons.     

Tuning degree distributions: Departing from scale-free networks

Scale-free networks are characterized by a degree distribution with power-law behavior. Although scale-free networks have been shown to arise in many areas, ranging from the World Wide Web to transportation or social networks, degree distributions of other observed networks often differ from the power-law type. Data based investigations require modifications of the typical scale-free network.We present an algorithm that generates networks in which the shape of the degree distribution is tunable by modifying the preferential attachment step of the Barabási-Albert construction algorithm. The shape of the distribution is represented by dispersion measures such as the variance and the skewness, both of which are highly correlated with the maximal degree of the network and, therefore, adequately represents the influence of superspreaders or hubs. By combining our algorithm with work of Holme and Kim, we show how to generate networks with a variety of degree distributions and clustering coefficients.     

Role of fractal dimension in random walks on scale-free networks

Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such networks are ubiquitous in real-life world. In this paper, we study the trapping problem on two families of networks. The first is deterministic, often called (x,y)-flowers; the other is random, which is a combination of (1,3)-flower and (2,4)-flower and thus called hybrid networks. The two network families display rich behavior as observed in various real systems, as well as some unique topological properties not shared by other networks. We derive analytically the average trapping time for random walks on both the (x,y)-flowers and the hybrid networks with an immobile trap positioned at an initial node, i.e., a hub node with the highest degree in the networks. Based on these analytical formulae, we show how the average trapping time scales with the network size. Comparing the obtained results, we further uncover that fractal dimension plays a decisive role in the behavior of average trapping time on fractal scale-free networks, i.e., the average trapping time decreases with an increasing fractal dimension.     

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 (non-small-world), fractal scaling with dimension d_B=ln (2q)/(ln 2), and disassortativity. Our results show that scale-free networks are not always small-world, and support the conjecture that self-similar scale-free networks are not assortative. Secondly, we define a deterministic family of graphs called small-world hierarchical lattices (SWHLs). Our construction preserves the structure of hierarchical lattices, including its degree distribution, fractal architecture, clustering coefficient, while the small-world phenomenon arises. Finally, the dynamical processes of intentional attacks and collective synchronization are studied and the comparisons between HLs and Barabási-Albert (BA) networks as well as SWHLs are shown. We find that the self-similar property of HLs and SWHLs significantly increases the robustness of such networks against targeted damage on hubs, as compared to the very vulnerable non fractal BA networks, and that HLs have poorer synchronizability than their counterparts SWHLs and BA networks. We show that degree distribution of scale-free networks does not suffice to characterize their synchronizability, and that networks with smaller average path length are not always easier to synchronize.     

Universal fractal scaling of self-organized networks

There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected nodes, are often self-organized, naturally emerging without any overarching designs on topological structure yet enabling efficient interactions among nodes. Here we show that the number of nodes and the density of connections in such self-organized networks exhibit a power law relationship. We examined the size and connection density of 47 self-organizing networks of various biological, social, and technological origins, and found that the size-density relationship follows a fractal relationship spanning over 6 orders of magnitude. This finding indicates that there is an optimal connection density in self-organized networks following fractal scaling regardless of their sizes.     

Network analysis of time series under the constraint of fixed nearest neighbors

In this paper, we carried out network analysis for typical time series, such as periodic signals, chaotic maps, Gaussian white noise, and fractal Brownian motions. By reconstructing the phase space for a given time series, we can generate a network under the constraint of fixed nearest neighbors. The mapped networks are then analyzed from both the statistical properties, such as degree distribution, clustering coefficient, betweenness, etc, as well as the local topological structures, i.e., network motifs. It is shown that time series of different nature can be distinguished from these two aspects of the constructed networks.     

花簇分形无标度网络中节点影响力的区分度

大量研究表明分形尺度特性广泛存在于真实复杂系统中, 且分形结构显著影响网络上的传播动力学行为. 虽然复杂网络的节点传播影响力吸引了越来越多学者的关注, 但依旧缺乏针对分形网络结构的节点影响力的系统研究. 鉴于此, 本文基于花簇分形网络模型, 研究了分形无标度结构上的节点传播影响力. 首先, 对比了不同分形维数下的节点影响力, 结果表明, 当分形维数很小时, 节点影响力的区分度几乎不随节点度变化, 很难区分不同节点的传播影响力, 而随着分形维数的增大, 从全局和局域角度都能很容易识别网络中的超级传播源. 其次, 通过对原分形网络进行不同程度的随机重连来分析网络噪声对节点影响力区分度的影响, 发现在低维分形网络上, 加入网络噪声之后能够容易区分不同节点的影响力, 而在无穷维超分形网络中, 加入网络噪声之后能够区分中间度节点的影响力, 但从全局和局域角度都很难识别中心节点的影响力. 所得结论进一步补充、深化了基于花簇分形网络的节点影响力研究, 研究结果对实际病毒传播的预警控制提供了一定的理论借鉴.     

Adsorption of a flexible self-avoiding polymer chain: Exact results on fractal lattices

The large-scale behavior of surface-interacting self-avoiding polymer chains placed on finitely ramified fractal lattices is studied using exact recursion relations. It is shown how to obtain surface susceptibility critical indices and how to modify a scaling relation for these indices in the case of fractal lattices. We present the exact results for critical exponents at the point of adsorption transition for polymer chains situated on a class of Sierpinski gasket-type fractals. We provide numerical evidence for a critical behavior of the type found recently in the case of bulk self-avoiding random walks at the fractal to Euclidean crossover.     

Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree

An unexpected recognition of fractal topology in some real-world scale-free networks has evoked again an interest in the mechanisms stimulating their evolution. To explain this phenomenon a few models of a deterministic construction as well as a probabilistic growth controlled by a tunable parameter have been proposed so far. A quite different approach based on the fully stochastic evolution of the fractal scale-free networks presented in this Letter counterpoises these former ideas. It is argued that the diffusive evolution of the network on the Cayley tree shapes its fractality, self-similarity and the branching number criticality without any control parameter. The last attribute of the scale-free network is an intrinsic property of the skeleton, a special type of spanning tree which determines its fractality.     

Effects of ramification and connectivity degree on site percolation threshold on regular lattices and fractal networks

This Letter is focused on the impact of network topology on the site percolation. Specifically, we study how the site percolation threshold depends on the network dimensions (topological d and fractal D), degree of connectivity (quantified by the mean coordination number $Z_{\infty }$), and arrangement of bonds (characterized by the connectivity index Q also called the ramification exponent). Using the Fisher's containment principle, we established exact inequalities between percolation thresholds on fractal networks contained in the square lattice. The values of site percolation thresholds on some fractal lattices were found by numerical simulations. Our findings suggest that the most relevant parameters to describe properly the values of site percolation thresholds on fractal networks contained in square lattice (Sierpiński carpets and Cantor tartans) and based on the square lattice (weighted planar stochastic fractal and Cantor lattices) are the mean coordination number and ramification exponent, but not the fractal dimension. Accordingly, we propose an empirical formula providing a good approximation for the site percolation thresholds on these networks. We also put forward an empirical formula for the site percolation thresholds on d-dimensional simple hypercubic lattices.     

基于社团结构的城市地铁网络模型研究

本文运用复杂网络理论, 对我国北京、上海、广州和深圳等城市的地铁网络进行了实证研究. 分别研究了地铁网络的度分布、聚类系数和平均路径长度. 研究表明, 该网络具有高的聚类系数和短的平均路径长度, 显示小世界网络的特征, 其度分布并不严格服从幂律分布或指数分布, 而是呈多段的分布, 显示层次网络的特征. 此外, 它还具有重叠的社团结构特征. 基于实证研究的结果, 提出一种基于社团结构的交通网络模型, 并对该模型进行了模拟分析, 模拟结果表明, 该模型的模拟结果与实证研究结果相符. 此外, 该模型还能解释其他类型的复杂网络(如城市公共汽车交通网络)的网络特性. 关键词： 复杂网络 地铁网络 小世界 社团     

Classification of Literary Works: Fractality and Complexity of the Narrative,Essay, and Research Article

A complex network as an abstraction of a language system has attracted much attention during the last decade. Linguistic typological research using quantitative measures is a current research topic based on the complex network approach. This research aims at showing the node degree, betweenness, shortest path length, clustering coefficient, and nearest neighbourhoods’ degree, as well as more complex measures such as: the fractal dimension, the complexity of a given network, the Area Under Box-covering, and the Area Under the Robustness Curve. The literary works of Mexican writers were classify according to their genre. Precisely 87% of the full word co-occurrence networks were classified as a fractal. Also, empirical evidence is presented that supports the conjecture that lemmatisation of the original text is a renormalisation process of the networks that preserve their fractal property and reveal stylistic attributes by genre.     

Fractal Analysis of Mobile Social Networks

Fractal and self similarity of complex networks have attracted much attention in recent years.The fractal dimension is a useful method to describe the fractal property of networks.However,the fractal features of mobile social networks(MSNs) are inadequately investigated.In this work,a box-covering method based on the ratio of excluded mass to closeness centrality is presented to investigate the fractal feature of MSNs.Using this method,we find that some MSNs are fractal at different time intervals.Our simulation results indicate that the proposed method is available for analyzing the fractal property of MSNs.     

Small-angle scattering from the deterministic fractal systems<Superscript>1</Superscript>

The intensity profile of small-angle neutron sc attering from three-dimensional triadic Cantor and Vicsek fractals is calculated when the fractal sets are monodisperse and their positions are uncorrelated. It is shown that the scattering intensities present minima and maxima superimposed on a power-law decay with the exponent coinciding with the fractal dimension of the scatterer. This is in accordance with the scattering from similar systems like Menger sponge or fractal jacks, which all exhibit the same behavior. For a finite iteration, the Porod power decay of the intensity is displayed at large values of momenta beyond the fractal region.     

Synchronization Dynamics in Non-Normal Networks: The Trade-Off for Optimality

Synchronization is an important behavior that characterizes many natural and human made systems that are composed by several interacting units. It can be found in a broad spectrum of applications, ranging from neuroscience to power-grids, to mention a few. Such systems synchronize because of the complex set of coupling they exhibit, with the latter being modeled by complex networks. The dynamical behavior of the system and the topology of the underlying network are strongly intertwined, raising the question of the optimal architecture that makes synchronization robust. The Master Stability Function (MSF) has been proposed and extensively studied as a generic framework for tackling synchronization problems. Using this method, it has been shown that, for a class of models, synchronization in strongly directed networks is robust to external perturbations. Recent findings indicate that many real-world networks are strongly directed, being potential candidates for optimal synchronization. Moreover, many empirical networks are also strongly non-normal. Inspired by this latter fact in this work, we address the role of the non-normality in the synchronization dynamics by pointing out that standard techniques, such as the MSF, may fail to predict the stability of synchronized states. We demonstrate that, due to a transient growth that is induced by the structure’s non-normality, the system might lose synchronization, contrary to the spectral prediction. These results lead to a trade-off between non-normality and directedness that should be properly considered when designing an optimal network, enhancing the robustness of synchronization.