Incomplete information in scale-free networks
arXiv:cond-mat/0411246
Abstract
We investigate the effect of incomplete information on the growth process of scale-free networks - a situation that occurs frequently e.g. in real existing citation networks. Two models are proposed and solved analytically for the scaling behavior of the connectivity distribution. These models show a varying scaling exponent with respect to the model parameters but no break-down of scaling thus introducing the first models of scale-free networks in an environment of incomplete information. We compare to results from computer simulations which show a very good agreement.
8 pages, 4 figures
References in corpus (16)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Fast algorithm for detecting community structure in networks
- Lethality and centrality in protein networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Organization of Growing Random Networks
- Evolution of reference networks with aging
- Truncation of power law behavior in "scale-free" network models due to information filtering
- The network topology of a potential energy landscape: A static scale-free network
- Saddle Points and Dynamics of Lennard-Jones Clusters, Solids and Supercooled Liquids
- Topology of biological networks and reliability of information processing
- Clustering of correlated networks
- Neutral Mutations and Punctuated Equilibrium in Evolving Genetic Networks