| | |
| | |
Stat |
Members: 3645 Articles: 2'504'585 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
Derivation of the percolation threshold for the network model of Barabasi and Albert | W. Pietsch
; | Rating: | Visitors: 5/5 (1 visitor) | Date: |
8 Sep 2005 | Subject: | Statistical Mechanics; Disordered Systems and Neural Networks | cond-mat.stat-mech cond-mat.dis-nn | Abstract: | The percolation threshold of the network model by Barabasi and Albert (BA-model) has thus far only been ’guessed’ based on simulations and comparison with other models - at least to our knowledge. Due to the still uncertain influence of correlations, the reference to other models cannot be justified. In this manuscript, we explicitly derive the well-known numerical values for the BA-model. To underline the importance of a null model like that of Barabasi and Albert, we close with some basic remarks about the nature of scale-free networks. We establish the reason for the fact, that scale-free networks - as found so abundantly in nature - result only from (at least asymptotically) linear preferential attachment: For linear preferential attachment only a minimum of topological knowledge about the network is required for the attachment process. | Source: | arXiv, cond-mat/0509214 | Other source: | [GID 185879] pmid16906919 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |