博文
review: Majority-vote on directed Erdos–Renyi random graphs
|||
Majority-vote on directed Erd˝os–R´enyi random graphs
F.W.S. Lima, A.O. Sousa, M.A. Sumuor
Physica A 387 (2008)
Abstract
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs.
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs.
Keywords: Monte Carlo; Critical exponents; Spin models; Networks; Majority-vote model
I comment:
I don't understand the meanings of this article due to weak mathematical foundatiion. But I think it will play an important part in my research in dynamics in random graph.
https://blog.sciencenet.cn/blog-468147-522981.html
上一篇：review: 从链接密度遍历序列中挖掘网络社团的层次结构
下一篇：review: Clustering and Fighting in Two-party Crowds: Simulat
扫一扫，分享此博文