OPINIONS DYNAMICS WITH RELATIVE AGREEMENT

Slides:



Advertisements
Similar presentations
Very simple to create with each dot representing a data value. Best for non continuous data but can be made for and quantitative data 2004 US Womens Soccer.
Advertisements

An Abstract Agent-based Simulation – the “relative agreement” opinion dynamics model Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan.
Analysis and Modeling of Social Networks Foudalis Ilias.
Improvement on LEACH Protocol of Wireless Sensor Network
Stephen McCray and David Courard-Hauri, Environmental Science and Policy Program, Drake University Introduction References 1.Doran, P. T. & Zimmerman,
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Joint social selection and social influence models for networks: The interplay of ties and attributes. Garry Robins Michael Johnston University of Melbourne,
Bootstrapping in regular graphs
A Model of Opinion Dynamics Among Firms Volker Barth, GELENA research group, Oldenburg University Potentials of Complexity Science for Business, Governments,
Why Globalized Communication may increase Cultural Polarization Paper presented at 2005 International Workshop Games, Networks, and Cascades Cornell Club.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.
Optimization of pocket design for extrusion with minimal defects Kathirgamanathan, P., Neitzert, T.
Agreement dynamics on interaction networks: the Naming game A. Baronchelli (La Sapienza, Rome, Italy) L. Dall’Asta (LPT, Orsay, France) V. Loreto (La Sapienza,
Verification & Validation
Acknowledgments This material is based in part upon work supported by the National Science Foundation under grant number Methods  GOAL: determine.
COURSE: JUST 3900 INTRODUCTORY STATISTICS FOR CRIMINAL JUSTICE Instructor: Dr. John J. Kerbs, Associate Professor Joint Ph.D. in Social Work and Sociology.
Copyright © Cengage Learning. All rights reserved. 2 Descriptive Analysis and Presentation of Single-Variable Data.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
2-Day Introduction to Agent-Based Modelling Day 2: Session 6 Mutual adaption.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
11 Confidence Intervals – Introduction A point estimate provides no information about the precision and reliability of estimation. For example, the sample.
11 Confidence Intervals – Introduction A point estimate provides no information about the precision and reliability of estimation. For example, the sample.
Biostatistics Case Studies 2006 Peter D. Christenson Biostatistician Session 2: Correlation of Time Courses of Simultaneous.
Frédéric Amblard - RUG-ICS Meeting - June 12, 2003 How can extremism prevail? An opinion dynamics model studied with heterogeneous agents and networks.
KNN CF: A Temporal Social Network kNN CF: A Temporal Social Network Neal Lathia, Stephen Hailes, Licia Capra University College London RecSys ’ 08 Advisor:
Chapter 2: Frequency Distributions. Frequency Distributions After collecting data, the first task for a researcher is to organize and simplify the data.
Simulating the Social Processes of Science Leiden| 9 April 2014 INGENIO [CSIC-UPV] Ciudad Politécnica de la Innovación | Edif 8E 4º Camino de Vera s/n.
Injecting Data into Simulation: Can Agent-Based Modelling Learn from Microsimulation? Samer Hassan Juan Pav ó n Nigel Gilbert Universidad Complutense de.
1 ICTP 27/05/02 How can extremism prevail ? A study based on the Relative agreement model G. Deffuant, G. Weisbuch, F. Amblard, T. Faure.
A novel approach to visualizing dark matter simulations
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
By: Jessica Browne and Alanna MacDonald
Connectivity and the Small World
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Chapter 24 Comparing Means.
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
Chapter 7 (b) – Point Estimation and Sampling Distributions
Grid Pix Field Simulations and precision needed for a module
Topics In Social Computing (67810)
The Matching Hypothesis
5.1 Probability of Simple Events
Volume 107, Issue 9, Pages (November 2014)
A new method for agent-based simulation dynamics analysis
StatQuest: t-SNE Clearly Expalined!!!!
problems with bounded variables
Descriptive Statistics
Effective Social Network Quarantine with Minimal Isolation Costs
Haim Kaplan and Uri Zwick
Amblard F.*, Deffuant G.*, Weisbuch G.** *Cemagref-LISC **ENS-LPS
Collins Assisi, Mark Stopfer, Maxim Bazhenov  Neuron 
CASE − Cognitive Agents for Social Environments
COMP60621 Designing for Parallelism
Task Force on Victimization Eurostat, October 2011 Guillaume Osier
The coalescent with recombination (Chapter 5, Part 1)
Instabilities in the Transient Response of Muscle
Dietmar B. Oelz, Boris Y. Rubinstein, Alex Mogilner 
Evolving cooperation in one-time interactions with strangers
Sampling Level 7/8 12/04/2019 Complete the questions on the sheet.
Kelly E. Caputo, Dooyoung Lee, Michael R. King, Daniel A. Hammer 
Mechanisms of Connectome Development
Facultés universitaires Notre Dame de la Paix à Namur (FUNDP)
Collins Assisi, Mark Stopfer, Maxim Bazhenov  Neuron 
Colocalization of Multiple DNA Loci: A Physical Mechanism
Continuous Density Queries for Moving Objects
Volume 107, Issue 9, Pages (November 2014)
Distribution-Free Procedures
T. Faure, G. Deffuant, G. Weisbuch, F. Amblard
Distributed Reinforcement Learning for Multi-Robot Decentralized Collective Construction Gyu-Young Hwang
Presentation transcript:

OPINIONS DYNAMICS WITH RELATIVE AGREEMENT An agent-based simulation approach We model opinion dynamics in populations of agents with continuous opinion and uncertainty. The opinions and uncertainties are modified by random pair interactions. We propose a new model of interactions, called the relative agreement model, which is a variant of the bounded confidence model (Hegselmann and Krause, 2002). In this model, uncertainty as well as opinion can be modified by interactions. We aim at studying the behaviour of this model under several conditions. Fully connected case… The model of opinion dynamics (Deffuant et al., 2002) Population of N agents Each agent i has: An opinion xi An associated uncertainty ui Pair-interactions between agents During an interaction between agents i and j, let us consider opinion segments si=[xi-ui, xi+ui] and sj=[xj-uj, xj+uj]. We define the agreement of agent i with j (it is not symmetric) as the overlap of sI and sj, minus the non-overlapping part. The overlap hij is given by: hij = min(xi+ui , xj+uj) - max(xi-ui , xj-uj) The non-overlapping width is: 2.ui – hij The agreement is then : hij - (2.ui – hij ) = 2.(hij – ui ) The relative agreement is the agreement divided by the length of segment si : 2.(hij – ui ) / 2.ui = hij/ui-1 If hij > ui, then the modification of xj and uj by the interaction with i is δxj = µ.(hij/ui – 1).(xi-xj) δuj = µ.(hij/ui – 1).(ui-uj) where µ is a constant parameter which amplitude controls the speed of the dynamics. If hij ≤ ui, there is no influence of i on j. Homogeneous population in uncertainty When every agent of the population is initialised with the same uncertainty U they tends to form clusters (cf. fig. left) the number of the clusters is close to w/2U (r2=0.99 cf. fig. right) w is the width of the initial distribution of the opinions Introduction of extremists (heterogeneity in uncertainty) x’j j i xi xj hij 2ui - hij Before interaction After interaction We now introduce extremists in our population: we suppose that agents at the extremes of the opinion distribution (proportion pe) are more confident (their uncertainty ue is lower). It follows different convergence cases in the population depending on the value of the uncertainty U of the other agents (the majority at the centre). We observe then three different convergence types: central convergence (top-left) where the majority converges at the centre and are not influenced by the extremes (typically for low values of U) both extreme convergence (upon) where the majority is attracted by both of the extremes (for higher values of U) single extreme convergence (on the left) where the majority is attracted by only one of the extreme (for high values of U and low extremists proportion in the population pe) A more systematic exploration of the parameter space (on the left) gives us patterns of the average of convergence cases (central is yellow, both extreme orange and single extreme brown) depending on the uncertainty of the majority U in x-axis and on the extremists proportion pe in y-axis. Intermediate colours corresponds to a mixture of the previous convergence cases. On a grid with Von Neumann’s neighbourhood… Simulations on a grid with extremists. The conditional interactions lead to formation of similar opinion patterns on the network which are then reinforced with quickly few zones of disagreement. We start from a situation where opinion are uniformly distributed on the grid (100 000 agents). Then, we pick up at random the chosen number of extremists of both sides. The mechanisms at play when we focus on the simulation dynamics is the following: Depending on the uncertainty of the majority U, the majority tends to converge rapidly to the centre. This convergence is observed locally. Then local extremists tends to attract the majority if this latter has not converged too much quickly and kept isolated the extremists. In this latter case it results in a central convergence process. Then if only one kind of extremists is kept connected to the majority, it results in a single extreme convergence. Else if the two kinds of extremists are present and connected to the majority it results in a both extreme convergence Finally, if the proportion of extremists is very low, the majority can still win the deal and it results in a central convergence (cf. fig. Left) Further investigations have to be made concerning both a most systematic exploration of the parameter space in this case and the exploration of other graph topologies (scale-free networks, small-worlds) F.Amblard*, G.Deffuant*, G.Weisbuch** - *Cemagref-LISC, **ENS-LPS : frederic.amblard@cemagref.fr