Effect of node deleting on network structure
arXiv:0704.0308 · doi:10.1016/j.physa.2007.02.039
Abstract
The ever-increasing knowledge of the structure of various real-world networks has uncovered their complex multi-mechanism-governed evolution processes. Therefore, a better understanding of the structure and evolution of these networked complex systems requires us to describe such processes in a more detailed and realistic manner. In this paper, we introduce a new type of network growth rule which comprises addition and deletion of nodes, and propose an evolving network model to investigate the effect of node deleting on network structure. It is found that, with the introduction of node deleting, network structure is significantly transformed. In particular, degree distribution of the network undergoes a transition from scale-free to exponential forms as the intensity of node deleting increases. At the same time, nontrivial disassortative degree correlation develops spontaneously as a natural result of network evolution in the model. We also demonstrate that node deleting introduced in the model does not destroy the connectedness of a growing network so long as the increasing rate of edges is not excessively small. In addition, it is found that node deleting will weaken but not eliminate the small-world effect of a growing network, and generally it will decrease the clustering coefficient in a network.
12 pages, 9 figures, to be published in physica a
References in corpus (32)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Lethality and centrality in protein networks
- Assortative mixing in networks
- Evolution of networks
- Mixing patterns in networks
- Classes of behavior of small-world networks
- Specificity and stability in topology of protein networks
- Mean-field theory for scale-free random networks
- Dynamical and correlation properties of the Internet
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Topology of evolving networks: local events and universality
- Large-scale topological and dynamical properties of Internet
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Evolution of reference networks with aging
- Highly clustered scale-free networks
- Giant strongly connected component of directed networks
- Robust Patterns in Food Web Structure
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Scaling properties of scale-free evolving networks: Continuous approach
- Scaling Behaviour of Developing and Decaying Networks
- Truncation of power law behavior in "scale-free" network models due to information filtering
- The origin of degree correlations in the Internet and other networks
- Scale-free network growth by ranking
- Fluctuation-driven dynamics of the Internet topology
- Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
- Evolving networks with disadvantaged long-range connections
- A Mutual Selection Model for Weighted Networks
- Pair Correlations in Scale-Free Networks
- Preferential survival in models of complex ad hoc networks