Abstract
In the voter model, agents possess binary opinions. At each time step, an agent is selected along with a social neighbor and adopts the opinion of that neighbor at the next time step. In this paper, we delve into a variant of the voter model known as an imitation model based on the majority. This model represents a network opinion framework where individuals, situated on the vertex set of a finite connected graph interpreted as a social network, exhibit one of two competing opinions labeled as +1 and −1. The agent alters its opinion solely when the count of social neighbors holding opposing viewpoints exceeds those aligning with the agent’s opinion. We explore the conditions leading to a consensus and investigate the probability of consensus on a finite connected social graph.
Sign-in/Register to access full text options 
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.
