Volume 88, Number 2, October 2009
|Number of page(s)
|06 November 2009
Optimization of consensus time by combining the voter and the majority voter models on scale-free networks
Department of Physics, Korea University - Seoul 136-713, Korea
2 Department of Physics, Chosun University - Gwangju 501-759, Korea
Corresponding author: firstname.lastname@example.org
Accepted: 7 October 2009
We introduce a spin model combining the majority voter model with probability p and the voter model with probability and then measure its consensus time on scale-free networks with various degree exponents γ. We find that consensus time depends on both p and γ. When all spins follow either the voter model or the majority voter model, it takes much greater time to reach consensus. On the other hand, when spins may alternate between the majority voter model and the voter model, consensus time is shortened. We find via numerical calculation that the optimized ratio to minimize consensus time is around .
PACS: 05.10.Ln – Monte Carlo methods / 89.75.-k – Complex systems / 89.75.Hc – Networks and genealogical trees
© EPLA, 2009
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.