Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
The role of persistent graphs in the agreement seeking of social networks
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-9940-5929
2013 (Engelska)Ingår i: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 31, nr 9, s. 595-606Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

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.

Ort, förlag, år, upplaga, sidor
2013. Vol. 31, nr 9, s. 595-606
Nyckelord [en]
Consensus, Dynamical Systems, Non-smooth analysis, Persistent Graphs, Social Networks
Nationell ämneskategori
Reglerteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-133399DOI: 10.1109/JSAC.2013.SUP.0513052ISI: 000326262800053Scopus ID: 2-s2.0-84883402176OAI: oai:DiVA.org:kth-133399DiVA, id: diva2:661584
Anmärkning

QC 20131104

Tillgänglig från: 2013-11-04 Skapad: 2013-10-31 Senast uppdaterad: 2017-12-06Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Johansson, Karl Henrik

Sök vidare i DiVA

Av författaren/redaktören
Shi, GuodongJohansson, Karl Henrik
Av organisationen
ReglerteknikACCESS Linnaeus Centre
I samma tidskrift
IEEE Journal on Selected Areas in Communications
Reglerteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 44 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf