Information sharing and sorting in a community

Biplab Bhattacherjee, S. S. Manna, and Animesh Mukherjee
Phys. Rev. E 87, 062808 – Published 17 June 2013

Abstract

We present the results of a detailed numerical study of a model for the sharing and sorting of information in a community consisting of a large number of agents. The information gathering takes place in a sequence of mutual bipartite interactions where randomly selected pairs of agents communicate with each other to enhance their knowledge and sort out the common information. Although our model is less restricted compared to the well-established naming game, the numerical results strongly indicate that the whole set of exponents characterizing this model are different from those of the naming game and they assume nontrivial values. Finally, it appears that in analogy to the emergence of clusters in the phenomenon of percolation, one can define clusters of agents here having the same information. We have studied in detail the growth of the largest cluster in this article and performed its finite-size scaling analysis.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 8 February 2013

DOI:https://doi.org/10.1103/PhysRevE.87.062808

©2013 American Physical Society

Authors & Affiliations

Biplab Bhattacherjee1, S. S. Manna1,*, and Animesh Mukherjee2

  • 1Satyendra Nath Bose National Centre for Basic Sciences, Block-JD, Sector-III, Salt Lake, Kolkata 700098, India
  • 2Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721302, India

  • *manna@bose.res.in

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 87, Iss. 6 — June 2013

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×