Volume 95, Number 5, September 2011
|Number of page(s)||5|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||25 August 2011|
Irreversible aggregation and network renormalization
Complexity Science Group, University of Calgary - Calgary T2N 1N4, Canada
2 FZ Jülich - D-52425 Jülich, Germany, EU
Accepted: 22 July 2011
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the complete solution for the probability to find any given state in an aggregation process (k+1)X→X, given a fixed number of unit mass particles in the initial state. Exactly the same probability distributions and scaling are found in one-dimensional systems (a trivial network) and well-mixed solutions. This reveals that scaling laws found in renormalization of complex networks do not prove that they are self-similar.
PACS: 89.75.Hc – Networks and genealogical trees / 02.10.Ox – Combinatorics; graph theory / 05.70.Ln – Nonequilibrium and irreversible thermodynamics
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.