Structure of growing networks with preferential linking.
By Sergey N. Dorogovtsev, José Fernando Ferreira Mendes, A. N. Samukhin. Physical Review Letters, 2000
1,166 citations recorded by the source corpus.
Subfields: Mathematical Physics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/17356d327c5040417ce9ac8e993ca026961c17f2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Mathematical Physics
- Mark Newman
- Alessandro Vespignani
- Albert-László Barabási
- Romualdo Pastor-Satorras
- José Fernando Ferreira Mendes
- Sergey N. Dorogovtsev
- Alexander V. Goltsev
- Juyong Park
In Statistical and Nonlinear Physics
- Mark Newman
- Santo Fortunato
- Alessandro Vespignani
- Marc Barthelemy
- Matjaz Perc
- Albert-László Barabási
- Alex Arenas
- José Fernando Ferreira Mendes
Citations in the corpus
- Synchronization in complex networks (2008, background): “The SF network considered by Chavez et al. (2005) is a generalized BA model with a preferential attachment probability πi ∼ ki + B (Dorogovtsev et al., 2000), where the parameter B controls the exponent γ = 3 +B/m of the power law degree distribution, and m = kmin.”
- The Structure and Function of Complex Networks (2003, background): “[123], but the expression for α given here is not valid in this limit.”
- Epidemics and immunization in scale‐free networks (2002, background): “s map this pattern in terms of networks, in which nodes represent individuals and links represent the possible contacts along which the epidemic diffuses. In this perspective scale-free (SF) networks [4, 5, 6] represents a very interesting cases since they exhibit a power-law connectivity distributi”
- Bipartite Graphs as Models of Complex Networks (2003, neutral): “[3, 27, 37].”
- Statistical physics of vaccination (2016, methodology): “Variations in preferential attachment function produced several other evolving network models like Dorogovtsev-Mendes-Samukhin (DMS) model (linear preferential attachment), Krapivsky model (nonlinear attachment probability), etc.[204].”
- Clustering and preferential attachment in growing networks. (2001, background): “2 and its inset we show empirical results for Rk for the databases studied here.”
- Evolution of networks (2001, background): “This value is exact; see [94, 169] and the discussion below.”
- Models of the Small World (2000, background): “…laws (Montroll and Shlesinger, 1982; Redner, 1990; Sornette and Cont, 1997), and indeed both numerical simulations (Baraba si et al., 1999) and exact analytic results (Dorogovtsev et al., 2000; Krapivsky et al., 2000) show power-law degree distributions for the model in the limit of long times.”