Pith. sign in

REVIEW

Effective information spreading based on local information in correlated networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1606.05408 v1 pith:3QTWKSDK submitted 2016-06-17 physics.soc-ph cs.SI

classification physics.soc-phcs.SI
keywords informationspreadinglocalinformedcontactnetworksconvergencedensity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Using network-based information to facilitate information spreading is an essential task for spreading dynamics in complex networks, which will benefit the promotion of technical innovations, healthy behaviors, new products, etc. Focusing on degree correlated networks, we propose a preferential contact strategy based on the local network structure and local informed density to promote the information spreading. During the spreading process, an informed node will preferentially select a contact target among its neighbors, basing on their degrees or local informed densities. By extensively implementing numerical simulations in synthetic and empirical networks, we find that when only consider the local structure information, the convergence time of information spreading will be remarkably reduced if low-degree neighbors are favored as contact targets. Meanwhile, the minimum convergence time depends non-monotonically on degree-degree correlation, and moderate correlation coefficients result in most efficient information spreading. Incorporating the informed density information into contact strategy, the convergence time of information spreading can be further reduced. Finally, we show that by using local informed density is more effective as compared with the global case.

Discussion (0). Sign in to comment.

Pith tools