|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Reverse engineering of linking preferences from network restructuring | | Gergely Palla
; Illes Farkas
; Imre Derenyi
; Albert-Laszlo Barabasi
; Tamas Vicsek
; | | Date: |
18 May 2004 | | Journal: | Phys. Rev. E 70, 046115 (2004) | | Subject: | Statistical Mechanics; Disordered Systems and Neural Networks | cond-mat.stat-mech cond-mat.dis-nn | | Abstract: | We provide a method to deduce the preferences governing the restructuring dynamics of a network from the observed rewiring of the edges. Our approach is applicable for systems in which the preferences can be formulated in terms of a single-vertex energy function with f(k) being the contribution of a node of degree k to the total energy, and the dynamics obeys the detailed balance. The method is first tested by Monte-Carlo simulations of restructuring graphs with known energies, then it is used to study variations of real network systems ranging from the co-authorship network of scientific publications to the asset graphs of the New York Stock Exchange. The empirical energies obtained from the restructuring can be described by a universal function f(k) -k ln(k), which is consistent with and justifies the validity of the preferential attachment rule proposed for growing networks. | | Source: | arXiv, cond-mat/0405399 | | Other source: | [GID 901682] pmid15600468 | | 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