[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Dynamical Systems

arXiv:1204.6624 (math)
[Submitted on 30 Apr 2012 (v1), last revised 26 Mar 2013 (this version, v2)]

Title:Theorems about Ergodicity and Class-Ergodicity of Chains with Applications in Known Consensus Models

Authors:Sadegh Bolouki, Roland P. Malhame
View PDF
Abstract:In a multi-agent system, unconditional (multiple) consensus is the property of reaching to (multiple) consensus irrespective of the instant and values at which states are initialized. For linear algorithms, occurrence of unconditional (multiple) consensus turns out to be equivalent to (class-) ergodicity of the transition chain (A_n). For a wide class of chains, chains with so-called balanced asymmetry property, necessary and sufficient conditions for ergodicity and class-ergodicity are derived. The results are employed to analyze the limiting behavior of agents' states in the JLM model, the Krause model, and the Cucker-Smale model. In particular, unconditional single or multiple consensus occurs in all three models. Moreover, a necessary and sufficient condition for unconditional consensus in the JLM model and a sufficient condition for consensus in the Cucker-Smale model are obtained.
Comments: 7 pages
Subjects: Dynamical Systems (math.DS); Systems and Control (eess.SY); Optimization and Control (math.OC)
Cite as: arXiv:1204.6624 [math.DS]
  (or arXiv:1204.6624v2 [math.DS] for this version)
  https://doi.org/10.48550/arXiv.1204.6624

Submission history

From: Sadegh Bolouki [view email]
[v1] Mon, 30 Apr 2012 13:21:53 UTC (13 KB)
[v2] Tue, 26 Mar 2013 21:50:08 UTC (13 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.DS
< prev   |   next >
new | recent | 2012-04
Change to browse by:
cs
cs.SY
eess
eess.SY
math
math.OC

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)