|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Towards correlated random networks | | W. Pietsch
; | | Date: |
15 Sep 2005 | | Subject: | Statistical Mechanics; Disordered Systems and Neural Networks | cond-mat.stat-mech cond-mat.dis-nn | | Abstract: | A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be arbitrarily chosen. Two different methods for the creation of such networks are presented: one of them is a generalization of a well-known algorithm by Maslov and Sneppen. The percolation threshold for the model is calculated and the result is tested using analytically solvable examples and simulations. In the end the principal importance of correlations and clustering for the topology of networks is discussed. Using a straight-forward extension of the network model by Barabasi and Albert, it is shown how a clustering-coefficient independent of the network size can originate in growing networks. | | Source: | arXiv, cond-mat/0509389 | | 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:
| |
REGISTER