Competition and multiscaling in evolving networks

@article{Barabasi2000CompetitionAM,
  title={Competition and multiscaling in evolving networks},
  author={G. Bianconi A.-L. Barab'asi},
  journal={EPL},
  year={2000},
  volume={54},
  pages={436-442}
}
The rate at which nodes in a network increase their connectivity depends on their fitness to compete for links. For example, in social networks some individuals acquire more social links than others, or on the www some webpages attract considerably more links than others. We find that this competition for links translates into multiscaling, i.e. a fitness- dependent dynamic exponent, allowing fitter nodes to overcome the more connected but less fit ones. Uncovering this fitter-gets-richer… 
View PDF on arXiv
740 Citations
Highly Influential Citations
66
Background Citations
218
Methods Citations
76
Results Citations
9

Figures from this paper

740 Citations

Weighted competition scale-free network.

A model of weighted scale-free networks incorporating a fit-gets-richer scheme which means the connectivity of the node depends on both the degree and fitness of the nodes, which indicates that asymptotically the scaling behaviors of the total weight distribution and the connectivity distribution are identical.

Emergence Of Multiscaling In Heterogeneous Complex Networks

Numerical evidence of the richer behavior of the connectivity degrees in heterogeneous preferential attachment networks in comparison to their homogeneous counterparts is provided.

Weighted Fitness Model in Complex Networks

  • Xinyi Chen
  • Computer Science
    2012 Spring Congress on Engineering and Technology
  • 2012
Uncovering this fitter-gets-richer phenomenon can help to understand in quantitative terms the evolution of many competitive systems in nature and society and Internet.

Evolving Scale-Free Local Networks with Fitness and Tunable Clustering

  • Min GeXiao-ping Chen
  • Computer Science
    2009 International Conference on Computational Intelligence and Software Engineering
  • 2009
The analytical and numerical expressions of the model consistent with the numerical simulations well are indicated, and the model explains the fitter-gets-richer phenomenon in local-world better, and helps us quantificationally comprehend many competitive systems’ evolution in nature and society.

Emergence of weight-topology correlations in complex scale-free networks

It is shown that networks with and without weight-topology correlations can emerge from the same simple growth dynamics of the nodes connectivities and of the links weights.

Evolution of two properties for scale-free network

Scale-free networks from varying vertex intrinsic fitness.

A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).

Priority Weighted Fitness Model in Complex Networks

  • Xinyi Chen
  • Computer Science
    2012 International Conference on Computer Science and Service System
  • 2012
A model based on these ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena.

Natural emergence of clusters and bursts in network evolution

This theoretical model shows that complex network structure can be generated without artificially imposing multiple dynamical mechanisms and may reveal potentially overlooked mechanisms present in complex systems.

Network dynamics: the world wide web

This thesis finds power-law distributions in website sizes, traffic, and links, and more importantly, develops a stochastic theory which explains them and demonstrates that the Web is a “small world”.
...

References

SHOWING 1-10 OF 13 REFERENCES

The Web as a Graph: Measurements, Models, and Methods

This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.

Random Graphs

Proc. Natl. Acad. Sci. USA

  • Proc. Natl. Acad. Sci. USA
  • 2000

Publ. Math. Inst. Acad. Sci

  • Publ. Math. Inst. Acad. Sci
  • 1960

International Conference on Combinatorics and Computing

  • International Conference on Combinatorics and Computing
  • 1999

Comput. Commun. Rev

  • Comput. Commun. Rev
  • 1999

J. Stat. Phys

  • J. Stat. Phys
  • 2000

Equation (9) can also be derived from the normalization condition 2k0t = jjN(t) kj, a " mass conservation " law, giving the total number of links in the network at time t

  • Equation (9) can also be derived from the normalization condition 2k0t = jjN(t) kj, a " mass conservation " law, giving the total number of links in the network at time t

In many systems, such as the www, nodes can acquire links through rewiring or the appearance of new internal links

    Science

    • Science
    • 2000