Universal features of information spreading efficiency on $d$-dimensional lattices

Abstract

A model for information spreading in a population of $N$ mobile agents is extended to $d$-dimensional regular lattices. This model, already studied on two-dimensional lattices, also takes into account the degeneration of information as it passes from one agent to the other. Here, we find that the structure of the underlying lattice strongly affects the time $\tau$ at which the whole population has been reached by information. By comparing numerical simulations with mean-field calculations, we show that dimension $d=2$ is marginal for this problem and mean-field calculations become exact for $d>2$. Nevertheless, the striking nonmonotonic behavior exhibited by the final degree of information with respect to $N$ and the lattice size $L$ appears to be geometry independent.

8 pages, 9 figures

References in corpus (5)

• Applications of Field-Theoretic Renormalization Group Methods to Reaction-Diffusion Problems
• Random walks on graphs: ideas, techniques and results
• A system of mobile agents to model social networks
• Efficiency of Information Spreading in a population of diffusing agents
• Trapping of a random walk by diffusing traps

Cited by in corpus (4)

• The effect of the forget-remember mechanism on spreading
• Autocatalytic reaction on low-dimensional substrates
• Phase transition for the Maki-Thompson rumour model on a small-world network
• Word-of-mouth and dynamical inhomogeneous markets: Efficiency measure and optimal sampling policies for the pre-launch stage