Graph Theoretic Methods in Multiagent Networks / / Mehran Mesbahi, Magnus Egerstedt.
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 net...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2010] ©2010 |
Year of Publication: | 2010 |
Edition: | Course Book |
Language: | English |
Series: | Princeton Series in Applied Mathematics ;
33 |
Online Access: | |
Physical Description: | 1 online resource (424 p.) :; 137 line illus. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781400835355 |
---|---|
ctrlnum |
(DE-B1597)446776 (OCoLC)979968498 |
collection |
bib_alma |
record_format |
marc |
spelling |
Mesbahi, Mehran, author. aut http://id.loc.gov/vocabulary/relators/aut Graph Theoretic Methods in Multiagent Networks / Mehran Mesbahi, Magnus Egerstedt. Course Book Princeton, NJ : Princeton University Press, [2010] ©2010 1 online resource (424 p.) : 137 line illus. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Princeton Series in Applied Mathematics ; 33 Frontmatter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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 Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022) Multiagent systems Mathematical models. Network analysis (Planning) Graphic methods. MATHEMATICS / Applied. bisacsh Addition. Adjacency matrix. Algebraic graph theory. Algorithm. Automorphism. Bipartite graph. Cardinality. Cartesian product. Circulant graph. Combinatorics. Complete graph. Computation. Connectivity (graph theory). Controllability. Convex combination. Corollary. Cycle graph (algebra). Cycle space. Degree (graph theory). Degree matrix. Diagonal matrix. Diameter. Differentiable function. Dimension. Directed graph. Division by zero. Dynamical system. Eigenvalues and eigenvectors. Equilibrium point. Estimation. Estimator. Existential quantification. Extremal graph theory. Graph (discrete mathematics). Graph theory. Identity matrix. Incidence matrix. Information exchange. Initial condition. Interconnection. Iteration. Kalman filter. Kronecker product. LTI system theory. LaSalle's invariance principle. Laplacian matrix. Least squares. Line graph. Linear map. Lipschitz continuity. Lyapunov function. Lyapunov stability. Markov chain. Mathematical optimization. Matrix exponential. Measurement. Multi-agent system. Nash equilibrium. Natural number. Network topology. Nonnegative matrix. Notation. Observability. Optimal control. Optimization problem. Pairwise. Parameter. Path graph. Permutation matrix. Permutation. Positive semidefinite. Positive-definite matrix. Probability. Quantity. Random graph. Random variable. Rate of convergence. Requirement. Result. Robotics. Scientific notation. Sensor. Sign (mathematics). Simplicial complex. Special case. Spectral graph theory. Stochastic matrix. Strongly connected component. Subset. Summation. Supergraph. Symmetric matrix. Systems theory. Theorem. Theory. Unit interval. Upper and lower bounds. Variable (mathematics). Vector space. Without loss of generality. Egerstedt, Magnus, author. aut http://id.loc.gov/vocabulary/relators/aut Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package 9783110515831 ZDB-23-PAM Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502 print 9780691140612 https://doi.org/10.1515/9781400835355 https://www.degruyter.com/isbn/9781400835355 Cover https://www.degruyter.com/document/cover/isbn/9781400835355/original |
language |
English |
format |
eBook |
author |
Mesbahi, Mehran, Mesbahi, Mehran, Egerstedt, Magnus, |
spellingShingle |
Mesbahi, Mehran, Mesbahi, Mehran, Egerstedt, Magnus, Graph Theoretic Methods in Multiagent Networks / Princeton Series in Applied Mathematics ; Frontmatter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
author_facet |
Mesbahi, Mehran, Mesbahi, Mehran, Egerstedt, Magnus, Egerstedt, Magnus, Egerstedt, Magnus, |
author_variant |
m m mm m m mm m e me |
author_role |
VerfasserIn VerfasserIn VerfasserIn |
author2 |
Egerstedt, Magnus, Egerstedt, Magnus, |
author2_variant |
m e me |
author2_role |
VerfasserIn VerfasserIn |
author_sort |
Mesbahi, Mehran, |
title |
Graph Theoretic Methods in Multiagent Networks / |
title_full |
Graph Theoretic Methods in Multiagent Networks / Mehran Mesbahi, Magnus Egerstedt. |
title_fullStr |
Graph Theoretic Methods in Multiagent Networks / Mehran Mesbahi, Magnus Egerstedt. |
title_full_unstemmed |
Graph Theoretic Methods in Multiagent Networks / Mehran Mesbahi, Magnus Egerstedt. |
title_auth |
Graph Theoretic Methods in Multiagent Networks / |
title_alt |
Frontmatter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
title_new |
Graph Theoretic Methods in Multiagent Networks / |
title_sort |
graph theoretic methods in multiagent networks / |
series |
Princeton Series in Applied Mathematics ; |
series2 |
Princeton Series in Applied Mathematics ; |
publisher |
Princeton University Press, |
publishDate |
2010 |
physical |
1 online resource (424 p.) : 137 line illus. Issued also in print. |
edition |
Course Book |
contents |
Frontmatter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
isbn |
9781400835355 9783110515831 9783110442502 9780691140612 |
callnumber-first |
T - Technology |
callnumber-subject |
T - General Technology |
callnumber-label |
T57 |
callnumber-sort |
T 257.85 M43 42010EB |
genre_facet |
Graphic methods. |
url |
https://doi.org/10.1515/9781400835355 https://www.degruyter.com/isbn/9781400835355 https://www.degruyter.com/document/cover/isbn/9781400835355/original |
illustrated |
Illustrated |
dewey-hundreds |
000 - Computer science, information & general works |
dewey-tens |
000 - Computer science, knowledge & systems |
dewey-ones |
006 - Special computer methods |
dewey-full |
006.3 |
dewey-sort |
16.3 |
dewey-raw |
006.3 |
dewey-search |
006.3 |
doi_str_mv |
10.1515/9781400835355 |
oclc_num |
979968498 |
work_keys_str_mv |
AT mesbahimehran graphtheoreticmethodsinmultiagentnetworks AT egerstedtmagnus graphtheoreticmethodsinmultiagentnetworks |
status_str |
n |
ids_txt_mv |
(DE-B1597)446776 (OCoLC)979968498 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
is_hierarchy_title |
Graph Theoretic Methods in Multiagent Networks / |
container_title |
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package |
author2_original_writing_str_mv |
noLinkedField noLinkedField |
_version_ |
1770176645568659456 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08854nam a22019575i 4500</leader><controlfield tag="001">9781400835355</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20102010nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400835355</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400835355</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)446776</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979968498</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">T57.85</subfield><subfield code="b">.M43 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">006.3</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mesbahi, Mehran, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph Theoretic Methods in Multiagent Networks /</subfield><subfield code="c">Mehran Mesbahi, Magnus Egerstedt.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2010]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (424 p.) :</subfield><subfield code="b">137 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Series in Applied Mathematics ;</subfield><subfield code="v">33</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Notation -- </subfield><subfield code="t">PART 1. FOUNDATIONS -- </subfield><subfield code="t">Chapter 1. Introduction -- </subfield><subfield code="t">Chapter 2. Graph Theory -- </subfield><subfield code="t">Chapter 3. The Agreement Protocol: Part I-The Static Case -- </subfield><subfield code="t">Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- </subfield><subfield code="t">Chapter 5. Probabilistic Analysis of Networks and Protocols -- </subfield><subfield code="t">PART 2. MULTIAGENT NETWORKS -- </subfield><subfield code="t">Chapter 6. Formation Control -- </subfield><subfield code="t">Chapter 7. Mobile Robots -- </subfield><subfield code="t">Chapter 8. Distributed Estimation -- </subfield><subfield code="t">Chapter 9. Social Networks, Epidemics, and Games -- </subfield><subfield code="t">PART 3. NETWORKS AS SYSTEMS -- </subfield><subfield code="t">Chapter 10. Agreement with Inputs and Outputs -- </subfield><subfield code="t">Chapter 11. Synthesis of Networks -- </subfield><subfield code="t">Chapter 12. Dynamic Graph Processes -- </subfield><subfield code="t">Chapter 13. Higher-order Networks -- </subfield><subfield code="t">Appendix A. -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Multiagent systems</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Network analysis (Planning)</subfield><subfield code="v">Graphic methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Network analysis (Planning)</subfield><subfield code="x">Graphic methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Addition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Adjacency matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Automorphism.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bipartite graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cardinality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cartesian product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Circulant graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complete graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Connectivity (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Controllability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Convex combination.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Corollary.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cycle graph (algebra).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cycle space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Degree (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Degree matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagonal matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Differentiable function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dimension.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Directed graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Division by zero.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dynamical system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Eigenvalues and eigenvectors.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Equilibrium point.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimator.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Existential quantification.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Extremal graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graph (discrete mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Identity matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Incidence matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Information exchange.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Initial condition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Interconnection.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iteration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kalman filter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kronecker product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LTI system theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">LaSalle's invariance principle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Laplacian matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Least squares.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Line graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear map.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lipschitz continuity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lyapunov function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lyapunov stability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov chain.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Matrix exponential.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Measurement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Multi-agent system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Natural number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network topology.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nonnegative matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Observability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimal control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Pairwise.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Path graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Positive semidefinite.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Positive-definite matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Probability.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Random variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Rate of convergence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Requirement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Result.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robotics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Scientific notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sensor.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sign (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simplicial complex.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Spectral graph theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Strongly connected component.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Subset.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Summation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Supergraph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Symmetric matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Systems theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Unit interval.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Upper and lower bounds.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Vector space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Without loss of generality.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Egerstedt, Magnus, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Series in Applied Mathematics eBook-Package</subfield><subfield code="z">9783110515831</subfield><subfield code="o">ZDB-23-PAM</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691140612</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400835355</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400835355</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400835355/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PAM</subfield></datafield></record></collection> |