Information propagation over signed networks:models and convergence analysis
In this paper,we consider the propagation problem for multiple pieces of information over a network with antagonistic interactions,modeled as a signed graph.The sign attached to an edge in this graph characterizes the cooperative(positive edge)or antagonistic(negative edge)relations between agents.The information propagation rules are established based on the sign of edge.When the interaction edge between agents is negative,the agent is supposed to update its state in two probability distributions: uniform and nonuniform,respectively.For the former scenario,necessary and sufficient conditions in terms of network topology are derived which guarantee the convergence of the propagation model.Furthermore,if the signed network is structurally balanced,complementary probabilities will be achieved on the same information by the bipartite subgroups.For the latter scenario,a new network is constructed based on the original network to analyse the generalised information propagation model.According to the connections between these two networks,we present a graph condition for the propagation model to converge.
Signed network Information propagation Convergence analysis Multi-agent network
LIN Xue
School of Mechano-Electronic Engineering,Xidian University,Xi”an,710071,P.R.China
国内会议
厦门
英文
353-359
2017-11-17（万方平台首次上网日期，不代表论文的发表时间）