Coarse-grained Monte Carlo simulations of the phase transition of Potts model on weighted networks
arXiv:1104.0491 · doi:10.1103/PhysRevE.83.066109
Abstract
Developing effective coarse grained (CG) approach is a promising way for studying dynamics on large size networks. In the present work, we have proposed a strength-based CG (\sCG) method to study critical phenomena of the Potts model on weighted complex networks. By merging nodes with close strength together, the original network is reduced to a CG-network with much smaller size, on which the CG-Hamiltonian can be well-defined. In particular, we make error analysis and show that our strength-based CG approach satisfies the condition of statistical consistency, which demands that the equilibrium probability distribution of the CG-model matches that of the microscopic counterpart. Extensive numerical simulations are performed on scale-free networks, without or with strength-correlation, showing that this \sCG approach works very well in reproducing the phase diagrams, fluctuations, and finite size effects of the microscopic model, while the \dCG approach proposed in our recent work [Phys. Rev. E 82, 011107(2010)] does not.
7 pages, 4 figures
References in corpus (14)
- Synchronization in complex networks
- Critical phenomena in complex networks
- Self-similarity of complex networks
- Skeleton and fractal scaling in complex networks
- Percolation on correlated networks
- Robust oscillations in SIS epidemics on adaptive networks: Coarse-graining by automated moment closure
- Spectral Coarse Graining and Synchronization in Oscillator Networks
- Complex networks renormalization: flows and fixed points
- Gene regulatory networks: a coarse-grained, equation-free approach to multiscale computation
- Geographical Coarsegraining of Complex Networks
- Coarse-graining the dynamics of coupled oscillators
- Statistics of Weighted Networks
- Statistically consistent coarse-grained simulations for critical phenomena in complex networks
- Rounding of first-order phase transitions and optimal cooperation in scale-free networks