Conflicting information propagation model in trust network

This study proposes an information propagation simulation model, which can deal with two conflicting information (A, A̅). We examine how "A̅" can restrain from propagating conflicting information "A" on the complex network N by use of this model. Simulations show that (1) choosing a node with the high order number as a source node to disseminate the information "A̅" can restrain from propagating the conflicting information "A", (2) dispatching the information "A̅" as soon as possible after propagating the conflicting information "A" can restrain from propagating the conflicting information "A", and (3) a restraining ratio of the number of nodes that hold "A̅" to the number of nodes that hold "A" after spreading the information "A" in nodes that exist father than the average shortest path converges to the certain small number.