Generalization of the Ehrenfest urn model to a complex network

被引:9
作者
Clark, Jaime [1 ]
Kiwi, Miguel [1 ,2 ]
Torres, Felipe [1 ,2 ]
Rogan, Jose [1 ,2 ]
Alejandro Valdivia, Juan [1 ,2 ]
机构
[1] Univ Chile, Fac Ciencias, Dept Fis, Santiago, Chile
[2] CEDENNA, Ctr Desarrollo Nanociencia & Nanotecnol, Santiago, Chile
关键词
SMALL-WORLD; DYNAMICS;
D O I
10.1103/PhysRevE.92.012103
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The Ehrenfest urn model is extended to a complex directed network, over which a conserved quantity is transported in a random fashion. The evolution of the conserved number of packets in each urn, or node of the network, is illustrated by means of a stochastic simulation. Using mean-field theory we were able to compute an approximation to the ensemble-average evolution of the number of packets in each node which, in the thermodynamic limit, agrees quite well with the results of the stochastic simulation. Using this analytic approximation we are able to find the asymptotic dynamical state of the system and the time scale to approach the equilibrium state, for different networks. The study is extended to large scale-free and small-world networks, in which the relevance of the connectivity distribution and the topology of the network for the distribution of time scales of the system is apparent. This analysis may contribute to the understanding of the transport properties in real networks subject to a perturbation, e.g., the asymptotic state and the time scale required to approach it.
引用
收藏
页数:8
相关论文
共 41 条
[1]  
Aiello W, 2002, MASSIVE COMP, V4, P97
[2]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[3]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[4]   Classes of small-world networks [J].
Amaral, LAN ;
Scala, A ;
Barthélémy, M ;
Stanley, HE .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) :11149-11152
[5]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[6]   SUPERTRACKS AND NTH ORDER WINDOWS IN THE CHAOTIC REGIME [J].
BARABASI, AL ;
NITSCH, L ;
DOROBANTU, IA .
PHYSICS LETTERS A, 1989, 139 (1-2) :53-56
[7]   Optimal traffic networks [J].
Barthelemy, Marc ;
Flammini, Alessandro .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2006,
[8]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[9]   Topology of technology graphs: Small world patterns in electronic circuits [J].
Ferrer i Cancho, R. ;
Janssen, C. ;
Solé, R.V. .
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2001, 64 (4 II) :461191-461195
[10]   The small world of human language [J].
Cancho, RFI ;
Solé, RV .
PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES, 2001, 268 (1482) :2261-2265