Scaling invariance in spectra of complex networks: a diffusion factorial moment approach.

نویسندگان

  • Fangcui Zhao
  • Huijie Yang
  • Binghong Wang
چکیده

A new method called diffusion factorial moment is used to obtain scaling features embedded in the spectra of complex networks. For an Erdos-Renyi network with connecting probability p(ER) < 1/N, the scaling parameter is delta = 0.51, while for p(ER) > or = 1/N the scaling parameter deviates from it significantly. For WS small-world networks, in the special region p(r) element of [0.05,0.2], typical scale invariance is found. For growing random networks, in the range of theta element of [0.33,049], we have delta = 0.6 +.- 0.1. And the value of delta oscillates around delta = 0.6 abruptly. In the range of delta element of [0.54,1], we have basically element of > 0.7. Scale invariance is one of the common features of the three kinds of networks, which can be employed as a global measurement of complex networks in a unified way.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling theory of transport in complex biological networks.

Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applications. However, it is a property that is not well understood in these systems, probably because of the lack of a general theoretical framework. Here, based on the finding that renormalization can be applied to bionetwor...

متن کامل

Comparison of MLP NN Approach with PCA and ICA for Extraction of Hidden Regulatory Signals in Biological Networks

The biologists now face with the masses of high dimensional datasets generated from various high-throughput technologies, which are outputs of complex inter-connected biological networks at different levels driven by a number of hidden regulatory signals. So far, many computational and statistical methods such as PCA and ICA have been employed for computing low-dimensional or hidden represe...

متن کامل

Invariance of the barycentric subdivision of a simplicial complex

‎In this paper we prove that a simplicial complex is determined‎ ‎uniquely up to isomorphism by its barycentric subdivision as well as‎ ‎its comparability graph‎. ‎We also put together several algebraic‎, ‎combinatorial and topological invariants of simplicial complexes‎.

متن کامل

Invariant Descriptors and Classifiers Combination for Recognition of Isolated Printed Tifinagh Characters

In order to improve the recognition rate, this document proposes an automatic system to recognize isolated printed Tifinagh characters by using a fusion of 3 classifiers and a combination of some features extraction methods. The Legendre moments, Zernike moments and Hu moments are used as descriptors in the features extraction phase due to their invariance to translation, rotation and scaling c...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 72 4 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2005