| |
| |
| Preface | |
| |
| |
| Notation | |
| |
| |
| |
| Foundations | |
| |
| |
| |
| Introduction | |
| |
| |
| |
| Hello, Networked World | |
| |
| |
| |
| Multiagent Systems | |
| |
| |
| |
| Information Exchange via Local Interactions | |
| |
| |
| |
| Graph-based Interaction Models | |
| |
| |
| |
| Looking Ahead | |
| |
| |
| |
| Graph Theory | |
| |
| |
| |
| Graphs | |
| |
| |
| |
| Variations on the Theme | |
| |
| |
| |
| Graphs and Matrices | |
| |
| |
| |
| Algebraic and Spectral Graph Theory | |
| |
| |
| |
| Graph Symmetries | |
| |
| |
| |
| The Agreement Protocol: Part I-The Static Case | |
| |
| |
| |
| Reaching Agreement: Undirected Networks | |
| |
| |
| |
| Reaching Agreement: Directed Networks | |
| |
| |
| |
| Agreement and Markov Chains | |
| |
| |
| |
| The Factorization Lemma | |
| |
| |
| |
| The Agreement Protocol: Part II-Lyapunov and LaSalle | |
| |
| |
| |
| Agreement via Lyapunov Functions | |
| |
| |
| |
| Agreement over Switching Digraphs | |
| |
| |
| |
| Edge Agreement | |
| |
| |
| |
| Beyond Linearity | |
| |
| |
| |
| Probabilistic Analysis of Networks and Protocols | |
| |
| |
| |
| Random Graphs | |
| |
| |
| |
| Agreement over Random Networks | |
| |
| |
| |
| Agreement in the Presence of Noise | |
| |
| |
| |
| Other Probabilistic Models of Networks | |
| |
| |
| |
| Multiagent Networks | |
| |
| |
| |
| Formation Control | |
| |
| |
| |
| Formation Specification: Shapes | |
| |
| |
| |
| Formation Specification: Relative States | |
| |
| |
| |
| Shape-based Control | |
| |
| |
| |
| Relative State-based Control | |
| |
| |
| |
| Dynamic Formation Selection | |
| |
| |
| |
| Assigning Roles | |
| |
| |
| |
| Mobile Robots | |
| |
| |
| |
| Cooperative Robotics | |
| |
| |
| |
| Weighted Graph-based Feedback | |
| |
| |
| |
| Dynamic Graphs | |
| |
| |
| |
| Formation Control Revisited | |
| |
| |
| |
| The Coverage Problem | |
| |
| |
| |
| Distributed Estimation | |
| |
| |
| |
| Distributed Linear Least Squares | |
| |
| |
| |
| Pulsed Intercluster Communication | |
| |
| |
| |
| Implementation over Wireless Networks | |
| |
| |
| |
| Distributed Kalman Filtering | |
| |
| |
| |
| Social Networks, Epidemics, and Games | |
| |
| |
| |
| Diffusion on Social Networks-The Max Protocol | |
| |
| |
| |
| The Threshold Protocol | |
| |
| |
| |
| Epidemics | |
| |
| |
| |
| The Chip Firing Game | |
| |
| |
| |
| Networks As Systems | |
| |
| |
| |
| Agreement with Inputs and Outputs | |
| |
| |
| |
| The Basic Input-Output Setup | |
| |
| |
| |
| Graph Theoretic Controllability: The SISO Case | |
| |
| |
| |
| Graph Theoretic Controllability: The MIMO Case | |
| |
| |
| |
| Agreement Reachability | |
| |
| |
| |
| Network Feedback | |
| |
| |
| |
| Optimal Control | |
| |
| |
| |
| Synthesis of Networks | |
| |
| |
| |
| Network Formation | |
| |
| |
| |
| Local Formation Games | |
| |
| |
| |
| Potential Games and Best Response Dynamics | |
| |
| |
| |
| Network Synthesis: A Global Perspective | |
| |
| |
| |
| Discrete and Greedy | |
| |
| |
| |
| Optimizing the Weighted Agreement | |
| |
| |
| |
| Dynamic Graph Processes | |
| |
| |
| |
| State-dependent Graphs | |
| |
| |
| |
| Graphical Equations | |
| |
| |
| |
| Dynamic Graph Controllability | |
| |
| |
| |
| What Graphs Can Be Realized? | |
| |
| |
| |
| Planning over Proximity Graphs | |
| |
| |
| |
| Higher-order Networks | |
| |
| |
| |
| Simplicial Complexes | |
| |
| |
| |
| Combinatorial Laplacians | |
| |
| |
| |
| Triangulations and the Rips Complex | |
| |
| |
| |
| The Nerve Complex | |
| |
| |
| |
| |
| |
| |
| Analysis | |
| |
| |
| |
| Matrix Theory | |
| |
| |
| |
| Control Theory | |
| |
| |
| |
| Probability | |
| |
| |
| |
| Optimization and Games | |
| |
| |
| Bibliography | |
| |
| |
| Index | |