Modeling gossip networks

Abstract

THE EFFECT OF GOSSIP ON SOCIAL NETWORKS

In this project we look at the effects of gossip spread on social network structure. We define gossip as information passed between two individuals A and B about an individual C who is not present, which has the potential to affect the strengths of all three relationships A-B, B-C, and A-C. This work is novel in two respects: first, there is no theoretical work on how network structure changes when information passing through a network has the potential to affect edges not in the direct path, and second while past studies have looked at how network structure affects gossip spread, there is no work done on how gossip spread affects network structure.

The latest pdf paper is available here: File:Gossip.pdf.

Gossipers David Brooks, Milena Tsvetkova, Allison Shaw, Chang Yu, and Roozbeh Daneshvar, hard at work.

Description

Motivation

schematic for modeling two possible ways in which gossip affects network structure -- both cases are where individual A passed gossip to individual B about individual C

• Work has been done on how information passing through networks influences strength of edges it passes over (e.g. neurons), but nothing done on how information passing along one edge affects strengths of other edges in network.
• Work has also been done to see how structure of network influences the flow of gossip / spreading of rumors (e.g. Lind et al., 2007), but nothing has yet been done on how gossip affects structure of network.

We propose to build some simple models to explore how gossip influences social network structure, where gossip is defined as information passed between two individuals, A and B, about a third individual C, that has the potential to influence the strength of all three connections AB, BC, and AC.

We will look at the effects of gossip modeled in several ways (described below) on the effects of network structure using several network types:

1. fully-connected
2. random
3. small-world
4. spatially clustered
5. (scale free)

MODEL1 (Null)

• start with one of the above network types
• do the following:

1. pick random triad of fully-connected nodes (A,B,C)
2. propagate negative gossip: strengthen A-B, and weaken B-C and A-C
3. repeat

• what is the resulting network? do simulations using this rule converge? does this depend on the initial network type?

(a priori expect that negative gossip will result in network becoming more fragmented)

MODEL2 (Spreading)

Spread of gossip through victim's network (see Lind et al., 2007)

• start with one of the above network types
• do the following:

1. pick a random victim
2. pick one of victim's friends as originator of gossip
3. originator shares gossip with friends in common (i.e. weight of edges changes according to assumptions of positive gossip as described above)
4. gossip spreads to (i.e. affects) all reachable connections of the victim
5. repeat

• what is the resulting network? do simulations using this rule converge? does this depend on the initial network type?

Extensions/Variants

SIMPLE:

• drop connections if they fall below a certain threshold
• in model2: have 'impact' of gossip change as you go down with each step away from original gossiper
• in model2: if A gossips to five secondary individuals (B1,B2,...) about C, does A-C increase 5x over?
• non-random node choice: pick nodes with respect to their overall connectedness (either picking strongly or weakly connected individuals more)
• non-random edge choice: stronger (or weaker) edges are more likely to have gossip passed along them

ALTERNATIVE GOSSIP RULES:

• try positive (instead of negative) gossip: pick V-shaped connection (see figure), add B-C connection

* possibly strengthen A-B since gossip increases trust. Alternatively assume that if B shares with A positive gossip about C, A diverts time from her relationship with B and starts hanging out with C, so weaken A-B instead.

* start from a sparse random network and see if we get a complete network?

* NOTE: is this a reasonable model for positive gossip? if nodes are only increased in strength, network will never converge...

* how do networks resulting from positive vs negative gossip differ?

* (a priori expect that positive gossip will result in the network becoming more connected)

• combined gossip types: pass both positive and negative gossip through network, vary % positive
• if A gossips to B about C: B weakens A-B and strengths B-C
• let all links (friendships) grow over time according to some function. gossip events change link location on curve (negative moves down, positive moves up).

HETEROGENEITY:

• individual variation: tendency to gossip, gossip target, impact of gossip
• individual behavior: individuals can choose to pass on the gossip, ignore it, or reject the gossiper and sever the connection
• How do individual properties (e.g. range of social circle, poverty, wealth, the information itself, or geographic location) speed up or slow down the spread of gossip?
• Can individuals influence their location in a network (e.g. increase centrality) by changing their gossiping frequency?

Predictions

• (ref?): gossiping leads to segmentation of a network where small well-connected clusters form. (A fully-connected network will turn into a small-world network with gossip.)

• (Boehm 1999, as cited in McAndrew 2008): gossip leads to equalization of social status of individuals in a network, using sum of all edges as proxy for social status. (A network where individuals have uneven social status will even out with gossip.)

• (McAndrew 2008): being the one person in a network who doesn't gossip will lead to social isolation

• (McAndrew 2008): being the person who always spreads gossip will lead to a reputation as untrustworthy

[add more here!]

Relevant Literature

• Baumeister, RF, L Zhang, and KD Vohs. 2004. Gossip as cultural learning. Review of General Psychology 8:111-121.

not as relevant, but suggests that gossip helps individuals learn cultural rules of their group

• Boehm, Christopher. 1999. Hierarchy in the Forest: The Evolution of Egalitarian Behavior. Harvard University Press.

gossip as leveling mechanism for neutralizing dominance tendency of others (cited in McAndrew 2008)

• Burt, Ronald S. 2001. Bandwidth and Echo: Trust, Information, and Gossip in Social Networks. In Networks and Markets, Alessandra Casella and James E. Rauch, eds. Russell Sage Foundation.

Social dynamics at play in the spread of gossip: biases in the selection of trusted third parties (one draws a sample of information consistent with one’s predisposition), the reinforcement of opinions in dyads due to an etiquette mechanism, the exaggeration of information in triads due to echo effects.

• Dunbar, R.I.M. 2004. Gossip in Evolutionary Perspective. Review of General Psychology 8(2):100–110.

Gossip is not about information but about creating and maintaining relationships (analogous to grooming among primates). Gossip also serves to control free-riders.

• Lind, Pedro G., Luciano R. da Silva, José S. Andrade Jr., and Hans J. Herrmann. 2006. How Gossip Propagates.

• Lind, Pedro G., Luciano R. da Silva, José S. Andrade Jr., and Hans J. Herrmann. 2007. The Spread of Gossip in American Schools. EPL 78(68005):1-5.

• Lind, Pedro G., Luciano R. da Silva, José S. Andrade Jr., and Hans J. Herrmann. 2007. Spreading Gossip in Social Networks. Physical Review E 76(036117):1-10.

• McAndrew, Frank T. 2008. The Science of Gossip: Why We Can't Stop Ourselves. Scientific American Mind.

• Wittek, Rafael, and Rudi Wielers. 1998. Gossip in Organizations. Computational & Mathematical Organization Theory 4(2):189–204.

Gossip strengthens the relationship between ego and alter and weakens an already weak relationship between the two and a third actor.

[add more here!]

Participation

Members

• Allison Shaw
• Chang Yu
• David Brooks
• Milena Tsvetkova
• Roozbeh Daneshvar

Tasks

• Allison/Roozbeh: create null model in NetLogo
• Milena/Roozbeh: create spreading model in NetLogo
• Milena: create NetLogo function to build different network types
• Roozbeh: come up with list of relevant network metrics and implement in NetLogo
  • degree distribution, done!
  • average path length
  • clustering coefficient
  • number of clusters, done!
• create NetLogo function to implement different gossip spreading rules
• read/gather literature
• generate predictions for model results
• Roozbeh: Come up with a function for increasing and decreasing weights of connections. If the type of the function does not impact the dynamics of the network, we can keep it as simple as possible. (This part is done. Now we have two increase and decrease functions for changing the weights and we just need to use them in every code. About consistency of opposite actions (increase and decrease), I did not spend more time on it as I thought that it is not a priority now).
• Chang: brainstorm how to incorporate heterogeneity into the network (implementation/predictions)

Chang Yu:some ideas :)

• follower tendency: This follower tendency happens to everyone. A person's behavior is affected by a group behavior when he wants to be admitted and accepted.And he will follow the majority behavior in this group. So when a listener(initail node) becomes to a gossiper, we can make it depend on gossiper-percentage of this node's neighbors. If a% of my neighbors are gossiping, I will be a gossiper.
• contact frequency: It's a counter in the model and can remember the frequency of linking between me and other nodes respectively.When an originator or gossiper wants to share, he doesn't tell a random or every reachable neighbor. He picks the most frequent neighbor.So do others.
• keep being a listener: meaning you just don't create or spread a gossip. I'm thinking whether this situation will affect this node's friend circle. Will it weaken his link strength or decrease the contact frequency with other nodes?

Original Discussion

It could be neat to develop a model of gossip networks. If you define gossip as information passed between 2 individuals (call them A and B) about a third party (C), then the act of gossiping has the potential to change the status/connection strength of all parties involved (e.g. maybe strength A-B, and weaken A-C and B-C bonds). Essentially passing information along a path in the network changes the value of BOTH edges in the direct pathway as well as other edges in the network. These are just preliminary ideas, but perhaps we could model how gossip tendency/frequency influences the structure of a network. Also, is it possible for individuals to influence their location in a network (e.g. increase centrality) by changing their gossiping frequency? (Although this is potentially a complicated rather than complex model idea...) Let me know what you guys think! Allison Shaw

• Milena Tsvetkova: This is a very interesting idea from sociological point of view. The effect of networks on the spread of gossip is well understood: some of the social dynamics at play include biases in the selection of trusted third parties (one draws a sample of information consistent with one’s predisposition), the reinforcement of opinions in dyads due to an etiquette mechanism, the exaggeration of information in triads due to echo effects. However, I am not aware of any studies that investigate how the spread of gossip affects network structure. My work is on the coevolution of behavior and social networks so we should talk!

• XOXO Chang Yu:Interesting! Gossip is not always bad. If we can model its spreading mechanism, it could help especially when you want to spread information unofficially. I get some inspirations from Tom’s last lecture on Friday. In the gossip network, what kind of properties of these agents can speed up or reduce information spread, the range of social circle, poverty, wealth, the information itself, or even the locations of houses in a community? I think we may model the different spreading results under different properties.

David Brooks: I agree that this concept of Gossip Networks is a generic for the analysis of several potential problems. I would like to talk to you about your intended direction and methods.

Gustavo Lacerda: sounds like some interesting dynamics, but how are you going to get data?

• Milena Tsvetkova: This article may be a good starting point for a first discussion: it suggest that gossip is a mechanism for bonding social groups. Should we try and schedule a brainstorming session?

Allison Shaw: Let's meet tomorrow (Thursday) around lunchtime (maybe 1pm after we've eaten?) to discuss this project in more depth -- anyone is welcome to join in!

Roozbeh Daneshvar: I'd like to join this team. It's good that we are doing a research with the same theme (Contagion in Networks). I can share the results from the heterogeneous network research group.