Emergence of scaling in random networks

@article{Barabsi1999EmergenceOS,
  title={Emergence of scaling in random networks},
  author={Barab{\'a}si and Albert},
  journal={Science},
  year={1999},
  volume={286 5439},
  pages={
          509-12
        }
}
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients… 

Weighted Scale-Free Random Graph Model

A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicate that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Research on BA scale-free random graph models

  • Xinyi ChenFurong Chang
  • Computer Science
    The 2nd International Conference on Information Science and Engineering
  • 2010
A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Weighted BA Scale-Free Random Graph Model

A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Priority weighted BA random graph model

  • Xinyi Chen
  • Computer Science
    2011 International Conference on Computer Science and Service System (CSSS)
  • 2011
A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

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.

Priority Weighted BA Scale-Free Random Graph model

  • Xinyi Chen
  • Computer Science
    2011 International Conference on Business Management and Electronic Information
  • 2011
A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Priority Weighted Fitness Model in Networks

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.

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.

Complex scale-free networks

The evolution of network topology by selective removal

This work proposes a new model that can generate broad-tailed networks even in the absence of network growth, by not only adding vertices, but also selectively eliminating vertices with a probability that is inversely related to the sum of their first- and second order connectivity.
...

References

SHOWING 1-10 OF 33 REFERENCES

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Internet: Growth dynamics of the World-Wide Web

It is found that web pages are distributed among sites according to a universal power law: many sites have only a few pages, whereas very few sites have hundreds of thousands of pages.

Size and form in efficient transportation networks

The theory accounts in a general way for the quarter-power allometric scaling of living organisms and predicts scaling relations applicable to all efficient transportation networks, which is verified from observational data on the river drainage basins.

Internet: Diameter of the World-Wide Web

The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it.

Social Network Analysis

This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued

Strong regularities in world wide web surfing

A model that assumes that users make a sequence of decisions to proceed to another page, continuing as long as the value of the current page exceeds some threshold, yields the probability distribution for the number of pages that a user visits within a given Web site.

Complexity and the economy

After two centuries of studying equilibria-static patterns that call for no further behavioral adjustments-economists are beginning to study the general emergence of structures and the unfolding of

How popular is your paper? An empirical study of the citation distribution

Abstract:Numerical data for the distribution of citations are examined for: (i) papers published in 1981 in journals which are catalogued by the Institute for Scientific Information (783,339 papers)

Searching the world wide Web

The coverage and recency of the major World Wide Web search engines was analyzed, yielding some surprising results, including a lower bound on the size of the indexable Web of 320 million pages.