Scaling Behaviour of Developing and Decaying Networks

Abstract

We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barabási and Albert in the particular case of growing networks. The networks considered here evolve according to the following rules: (i) Each instant a new site is added, the probability of its connection to old sites is proportional to their connectivities. (ii) In addition, (a) new links between some old sites appear with probability proportional to the product of their connectivities or (b) some links between old sites are removed with equal probability.

7 pages (revtex)

References in corpus (10)

• Emergence of scaling in random networks
• The diameter of the world wide web
• Mean-field theory for scale-free random networks
• Renormalization group analysis of the small-world network model
• Scaling and percolation in the small-world network model
• Evolution of reference networks with aging
• Are citations of scientific papers a case of nonextensivity ?
• Exactly solvable analogy of small-world networks
• Erratum: Small-world networks: Evidence for a crossover picture
• Growing network with heritable connectivity of nodes

Cited by in corpus (71)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Evolution of networks
• Evolution of the social network of scientific collaborations
• Dynamical and correlation properties of the Internet
• Large-scale topological and dynamical properties of Internet
• Co-evolution of strategy and structure in complex networks with dynamical linking
• Pseudofractal Scale-free Web
• Deterministic Scale-Free Networks
• Weighted Evolving Networks
• Are randomly grown graphs really random?
• Degree Distributions of Growing Networks
• Generic scale of the "scale-free" growing networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Scaling properties of scale-free evolving networks: Continuous approach
• General Dynamics of Topology and Traffic on Weighted Technological Networks
• Accurately modeling the Internet topology
• Effect of the accelerating growth of communications networks on their structure
• Exact solutions for models of evolving networks with addition and deletion of nodes
• Statistical ensemble of scale-free random graphs
• Anomalous percolating properties of growing networks
• Weighted Assortative And Disassortative Networks Model
• Aggregate Characterization of User Behavior in Twitter and Analysis of the Retweet Graph
• Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
• Modes of Collaboration in Modern Science - Beyond Power Laws and Preferential Attachment
• Growth and structure of Slovenia's scientific collaboration network
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Shortest paths and load scaling in scale-free trees
• High dimensional random Apollonian networks
• Principles of statistical mechanics of random networks
• Networks in life: Scaling properties and eigenvalue spectra
• Network Structures from Selection Principles
• A Mutual Selection Model for Weighted Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• Tree Networks with Causal Structure
• Complex network view of evolving manifolds
• A critical look at power law modelling of the Internet
• Hidden Symmetries in Real and Theoretical Networks
• Evolving small-world scale-free networks consist of cliques
• A Mutual Attraction Model for Both Assortative and Disassortative Weighted Networks
• Understanding the internet topology evolution dynamics
• Complex systems approach to natural language
• Exactly solvable scale-free network model
• Accelerating, hyper-accelerating, and decelerating probabilistic networks
• Zipf's law and log-normal distributions in measures of scientific output across fields and institutions: 40 years of Slovenia's research as an example
• Modeling the average shortest path length in growth of word-adjacency networks
• Effect of node deleting on network structure
• Complex Network Properties of Chinese Natural Science Basic Research
• Growing networks with preferential addition and deletion of edges
• Topological phase transition in a network model with preferential attachment and node removal
• An Evolving model of online bipartite networks
• Multiple Scale-Free Structures in Complex Ad-Hoc Networks
• Growing community networks with local events
• Fast Sparsely Synchronized Brain Rhythms in A Scale-Free Neural Network
• Quantitative description and modeling of real networks
• Scale free networks by preferential depletion
• Preferential survival in models of complex ad hoc networks
• Randomly Evolving Idiotypic Networks: Structural Properties and Architecture
• Gravity Effects on Information Filtering and Network Evolving
• Vertex labeling and routing in expanded Apollonian networks
• Spectral and Dynamic Consequences of Network Specialization
• A Theoretical Model for Understanding the Dynamics of Online Social Networks Decay
• Stochastic resetting in a networked multiparticle system with correlated transitions
• A Maximum Entropy Method for the Prediction of Size Distributions
• Raising Graphs From Randomness to Reveal Information Networks
• Average shortest-path length in word-adjacency networks: Chinese versus English
• Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
• A Simple Model of Scale-free Networks Driven by both Randomness and Adaptability
• Analysis of a Model for Generating Weakly Scale-free Networks
• Evolving Network With Different Edges
• General Connectivity Distribution Functions for Growing Networks with Preferential Attachment of Fractional Power