The role of persistent graphs in the agreement seeking of social networks
2013 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 31, no 9, 595-606 p.Article in journal (Refereed) Published
This paper investigates the role persistent relations play for a social network to reach a global belief agreement under discrete-time or continuous-time evolution. Each directed arc in the underlying communication graph is assumed to be associated with a time-dependent weight function, which describes the strength of the information flow from one node to another. An arc is said to be persistent if its weight function has infinite L1 or l1 norm for continuous or discrete belief evolutions, respectively. The graph that consists of all persistent arcs is called the persistent graph of the underlying network. Three necessary and sufficient conditions on agreement or ε-agreement are established. We prove that the persistent graph fully determines the convergence to a common opinion in a social network. It is shown how the convergence rate explicitly depends on the diameter of the persistent graph. For a social networking service like Facebook, our results indicate how permanent friendships need to be and what network topology they should form for the network to be an efficient platform for opinion diffusion.
Place, publisher, year, edition, pages
2013. Vol. 31, no 9, 595-606 p.
Consensus, Dynamical Systems, Non-smooth analysis, Persistent Graphs, Social Networks
IdentifiersURN: urn:nbn:se:kth:diva-133399DOI: 10.1109/JSAC.2013.SUP.0513052ISI: 000326262800053ScopusID: 2-s2.0-84883402176OAI: oai:DiVA.org:kth-133399DiVA: diva2:661584
QC 201311042013-11-042013-10-312013-12-06Bibliographically approved