Structure of Flow and Noise on Functional Scale-Free Networks(COMPLEXITY AND NONEXTENSIVITY:NEW TRENDS IN STATISTICAL MECHANICS)
暂无分享,去创建一个
Topological heterogeneity of structured networks effects course of dynamic processes on them by causing uneven function of nodes and/or links. Within the model of information traffic we demonstrate how dynamically relevant topology emerges on cyclic scale-free Web graph. The dynamic centrality measures are quantitatively characterized through analysis of traffic flow and multichannel noise. The dynamically generated heterogeneity of links is represented by maximum spanning tree. Fluctuations of noise at individual nodes in traffic on the original graph and on its maximum spanning tree (optimal transport) reveal universal scaling features that are related to the underlying link structure and driving conditions. Furthermore, we give some evidence for stochastic ergodicity breaking in traffic on networks.
[1] Bosiljka Tadić,et al. Modeling Traffic of Information Packets on Graphs with Complex Topology , 2003, International Conference on Computational Science.
[2] B. Tadić. Exploring Complex Graphs by Random Walks , 2003, cond-mat/0310014.