Noise in Naming Games, partial synchronization and community detection in social networks

Details Noise in Naming Games, partial synchronization and community detection in social networks Noise in Naming Games, partial synchronization and community detection in social networks

2010-08-24

arxiv.org/abs/1008.4115v1

Computer Science

Multiagent Systems

Scientific paper

The Naming Games (NG) are agent-based models for agreement dynamics, peer pressure and herding in social networks, and protocol selection in autonomous ad-hoc sensor networks. By introducing a small noise term to the NG, the resulting Markov Chain model called Noisy Naming Games (NNG) are ergodic, in which all partial consensus states are recurrent. By using Gibbs-Markov equivalence we show how to get the NNG's stationary distribution in terms of the local specification of a related Markov Random Field (MRF). By ordering the partially-synchronized states according to their Gibbs energy, taken here to be a good measure of social tension, this method offers an enhanced method for community-detection in social interaction data. We show how the lowest Gibbs energy multi-name states separate and display the hidden community structures within a social network.

Affiliated with

Also associated with

No associations

Rating

Noise in Naming Games, partial synchronization and community detection in social networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Noise in Naming Games, partial synchronization and community detection in social networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noise in Naming Games, partial synchronization and community detection in social networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394306