Abstract
We present a mathematical description of the voter model dynamics on uncorrelated networks. When the average degree of the graph is μ⩽2 the system reaches complete order exponentially fast. For μ>2, a finite system falls, before it fully orders, in a quasi-stationary state in which the average density of active links (links between opposite-state nodes) in surviving runs is constant and equal to , while an infinitely large system stays ad infinitum in a partially ordered stationary active state. The mean lifetime of the quasi-stationary state is proportional to the mean time to reach the fully ordered state T, which scales as , where N is the number of nodes of the network, and μ2 is the second moment of the degree distribution. We find good agreement between these analytical results and numerical simulations on random networks with various degree distributions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
