Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Agreeing under randomized network dynamics
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2012 (English)In: 2012 American Control Conference (ACC), IEEE Computer Society, 2012, 2394-2400 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we study randomized consensus processing over general random graphs. At time step k, each node will follow the standard consensus algorithm, or stick to current state by a simple Bernoulli trial with success probability pk. Connectivity-independent and arc-independent graphs are defined, respectively, to capture the fundamental independence of random graph processes with respect to a consensus convergence. Sufficient and/or necessary conditions are presented on the success probability sequence for the network to reach a global a.s. consensus under various conditions of the communication graphs. Particularly, for arc-independent graphs with simple self-confidence condition, we show that Σk pk is a sharp threshold corresponding to a consensus 0 1 law, i.e., the consensus probability is 0 for almost all initial conditions if Σk pk converges, and jumps to 1 for all initial conditions if Σk pk diverges.

Place, publisher, year, edition, pages
IEEE Computer Society, 2012. 2394-2400 p.
Series
Proceedings of the American Control Conference, ISSN 0743-1619
Keyword [en]
Consensus algorithms, Dynamics Randomization, Random graphs, Threshold
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-108015ISI: 000310776202112Scopus ID: 2-s2.0-84869487129ISBN: 978-145771095-7 (print)OAI: oai:DiVA.org:kth-108015DiVA: diva2:580260
Conference
2012 American Control Conference, ACC 2012, 27 June 2012 through 29 June 2012, Montreal, QC
Funder
ICT - The Next Generation
Note

QC 20121221

Available from: 2012-12-21 Created: 2012-12-19 Last updated: 2013-04-11Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Shi, GuodongJohansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf