Introduction to Averaging Dynamics over Networks.
Material type:
- text
- computer
- online resource
- 9783319680224
- TJ212-225
Intro -- Preface -- Averaging Dynamics and Multi-agent Systems -- Aims and Scope -- Contents -- Contents -- 1 Graph Theory -- 1.1 Basic Definitions and Examples -- 1.2 Paths and Connectivity -- 1.3 Periodicity -- 1.4 Matrices and Eigenvalues -- 1.5 Examples of Graphs -- 1.5.1 Circulant Graphs -- 1.5.2 Product Graphs -- 1.5.3 Cayley Graphs -- 1.5.4 De Bruijn Graphs -- References -- 2 Averaging in Time-Invariant Networks -- 2.1 Rendezvous and Consensus -- 2.2 Averaging on Symmetric Regular Graphs -- 2.3 Stochastic Matrices and Averaging -- 2.4 Convergence Rate and Eigenvalues -- 2.5 Consensus Point -- 2.6 Stochastic Matrices Adapted to a Graph -- 2.7 Convergence Rate: Examples -- 2.8 Reversible Matrices -- References -- 3 Averaging in Time-Varying Networks -- 3.1 Time-Varying Updates: Uniform Connectivity -- 3.2 Time-Varying Updates: Cut-Balanced Interactions -- 3.3 Randomized Updates -- References -- 4 Performance and Robustness of Averaging Algorithms -- 4.1 A Deeper Analysis of the Convergence to Consensus -- 4.2 Rendezvous and Linear-Quadratic Control -- 4.3 Robustness Against Noise -- 4.4 Robustness Against Quantization Errors -- 4.5 Distributed Inference -- References -- 5 Averaging with Exogenous Inputs and Electrical Networks -- 5.1 Electrical Networks and Harmonic Functions -- 5.2 Effective Resistance in Electrical Networks -- 5.3 Averaging Dynamics with Stubborn Agents -- 5.4 Estimation from Relative Measurements -- References -- Index.
Description based on publisher supplied metadata and other sources.
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
There are no comments on this title.