Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 2,960Distributed Control Multi-Agent SystemsNeural Networks Stability and SynchronizationOpinion Dynamics and Social Influence

The DOI matches its Crossref record.

Graph Theoretic Methods in Multiagent Networks

Mesbahi, Mehran, Egerstedt, Magnus·2010·Princeton University Press eBooks

Abstract

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA

Overview

Integrity signals

Registry

Crossref · 10.1515/9781400835355

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cited by

See all 2,960

Metadata

Authors
Mesbahi, M., & Egerstedt, M.
Venue
Princeton University Press eBooks
Published
2010-12-31
OpenAlex
W613360614
Cited by
2,897
References
0
Citations by year
2026: 44 · 2025: 116 · 2024: 172 · 2023: 193 · 2022: 184 · 2021: 244 · 2020: 231 · 2019: 265 · 2018: 259 · 2017: 240 · 2016: 186 · 2015: 213 · 2014: 200 · 2013: 163 · 2012: 109
FWCI
74.30
Type
book
Language
en
Open access
closed
Locations
Princeton University Press eBooks (publishedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
Keywords
multi-agent systems, graph theory, consensus algorithms, formation control, distributed estimation, social networks, simplicial complexes, higher-order interactions, switching networks, random networks, directed graphs, networked systems, control-theoretic analysis, distributed robotics, mobile sensor networks, biological synchronization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Graph Theoretic Methods in Multiagent Networks. https://app.cochat.ai/papers/10.1515/9781400835355
The paper
Mesbahi, M., & Egerstedt, M. (2010). Graph Theoretic Methods in Multiagent Networks. Princeton University Press eBooks. https://doi.org/10.1515/9781400835355

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.