Volume 90, Number 3, May 2010
|Number of page(s)||5|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||28 May 2010|
Dynamic networks and directed percolation
Minerva Center & Department of Physics, Bar-Ilan University - Ramat Gan, Israel
2 Center for Polymer Studies, Boston University - Boston, MA 02215, USA
3 Department of Mathematics, Bar-Ilan University - Ramat Gan, Israel
Corresponding author: email@example.com
Accepted: 26 April 2010
We introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the time evolution of the network. We show that the dynamic network undergoes a percolation phase transition at a critical concentration pc, that decreases with the rate r at which the network links are changed. The behavior near criticality is universal and independent of r. We find that for dynamic random networks fundamental laws are changed. i) The size of the giant component at criticality scales with the network size N for all values of r, rather than as in static networks. ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as , compared to in a static network.
PACS: 89.75.Fb – Structures and organization in complex systems / 02.50.Cw – Probability theory
© EPLA, 2010
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.