pith. sign in

arxiv: cond-mat/0605560 · v1 · submitted 2006-05-23 · ❄️ cond-mat.stat-mech

Efficiency of Information Spreading in a population of diffusing agents

classification ❄️ cond-mat.stat-mech
keywords informationagentspopulationagentalphabetadiffusinginformed
0
0 comments X
read the original abstract

We introduce a model for information spreading among a population of N agents diffusing on a square LxL lattice, starting from an informed agent (Source). Information passing from informed to unaware agents occurs whenever the relative distance is < 1. Numerical simulations show that the time required for the information to reach all agents scales as N^{-alpha}L^{beta}, where alpha and beta are noninteger. A decay factor z takes into account the degeneration of information as it passes from one agent to another; the final average degree of information of the population, I_{av}(z), is thus history-dependent. We find that the behavior of I_{av}(z) is non-monotonic with respect to N and L and displays a set of minima. Part of the results are recovered with analytical approximations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.