|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Temperature in complex networks | | Diego Garlaschelli
; Sebastian E. Ahnert
; Thomas M. A. Fink
; Guido Caldarelli
; | | Date: |
30 Jun 2006 | | Subject: | Disordered Systems and Neural Networks; Statistical Mechanics | | Abstract: | Various statistical-mechanics approaches to complex networks have been proposed to describe expected topological properties in terms of ensemble averages. Here we extend this formalism by introducing the fundamental concept of graph temperature, controlling the degree of topological optimization of a network. We recover the temperature-dependent version of various important models as particular cases of our approach, and show examples where, remarkably, the onset of a percolation transition, a scale-free degree distribution, correlations and clustering can be understood as natural properties of an optimized (low-temperature) topology. We then apply our formalism to real weighted networks and we compute their temperature, finding that various techniques used to extract information from complex networks are again particular cases of our approach. | | Source: | arXiv, cond-mat/0606805 | | 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.
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER