pith. sign in

arxiv: cond-mat/9910332 · v1 · pith:DRFOKOJMnew · submitted 1999-10-21 · ❄️ cond-mat.dis-nn · adap-org· cond-mat.stat-mech· nlin.AO

Emergence of scaling in random networks

classification ❄️ cond-mat.dis-nn adap-orgcond-mat.stat-mechnlin.AO
keywords networkslargescale-freesystemsverticesadditionalreadyattach
0
0 comments X
read the original abstract

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 is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites. A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Formalization of the generalized Pareto principle and structural typicality of the 20/80-rule

    physics.soc-ph 2026-02 unverdicted novelty 7.0

    A formalization of the generalized Pareto principle derives that exponential and normal distributions with 100 to 100,000 samples produce p values near 0.2, close to the 80/20 rule and below prior saturation conjectures.