Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
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 |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- 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 |
| Record Nr. | UNINA-9910785659103321 |
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
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 |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- 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 |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The structure of affine buildings [[electronic resource] /] / Richard M. Weiss
| The structure of affine buildings [[electronic resource] /] / Richard M. Weiss |
| Autore | Weiss Richard M (Richard Mark), <1946-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, c2009 |
| Descrizione fisica | 1 online resource (381 p.) |
| Disciplina | 512/.2 |
| Collana | Annals of mathematics studies |
| Soggetto topico |
Buildings (Group theory)
Moufang loops Automorphisms Affine algebraic groups |
| Soggetto non controllato |
Addition
Additive group Additive inverse Algebraic group Algebraic structure Ambient space Associative property Automorphism Big O notation Bijection Bilinear form Bounded set (topological vector space) Bounded set Calculation Cardinality Cauchy sequence Commutative property Complete graph Complete metric space Composition algebra Connected component (graph theory) Consistency Continuous function Coordinate system Corollary Coxeter group Coxeter–Dynkin diagram Diagram (category theory) Diameter Dimension Discrete valuation Division algebra Dot product Dynkin diagram E6 (mathematics) E7 (mathematics) E8 (mathematics) Empty set Equipollence (geometry) Equivalence class Equivalence relation Euclidean geometry Euclidean space Existential quantification Free monoid Fundamental domain Hyperplane Infimum and supremum Jacques Tits K0 Linear combination Mathematical induction Metric space Multiple edges Multiplicative inverse Number theory Octonion Parameter Permutation group Permutation Pointwise Polygon Projective line Quadratic form Quaternion Remainder Root datum Root system Scientific notation Sphere Subgroup Subring Subset Substructure Theorem Topology of uniform convergence Topology Torus Tree (data structure) Tree structure Two-dimensional space Uniform continuity Valuation (algebra) Vector space Without loss of generality |
| ISBN |
1-282-45836-1
9786612458361 1-4008-2905-4 |
| Classificazione | SI 830 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter 1. Affine Coxeter Diagrams -- Chapter 2. Root Systems -- Chapter 3. Root Data with Valuation -- Chapter 4. Sectors -- Chapter 5. Faces -- Chapter 6. Gems -- Chapter 7. Affine Buildings -- Chapter 8. The Building at Infinity -- Chapter 9. Trees with Valuation -- Chapter 10. Wall Trees -- Chapter 11. Panel Trees -- Chapter 12. Tree-Preserving Isomorphisms -- Chapter 13. The Moufang Property at Infinity -- Chapter 14. Existence -- Chapter 15. Partial Valuations -- Chapter 16. Bruhat-Tits Theory -- Chapter 17. Completions -- Chapter 18. Automorphisms and Residues -- Chapter 19. Quadrangles of Quadratic Form Type -- Chapter 20. Quadrangles of Indifferent Type -- Chapter 21. Quadrangles of Type E6, E7 and E8 -- Chapter 22. Quadrangles of Type F4 -- Chapter 23. Quadrangles of Involutory Type -- Chapter 24. Pseudo-Quadratic Quadrangles -- Chapter 25. Hexagons -- Chapter 26. Assorted Conclusions -- Chapter 27. Summary of the Classification -- Chapter 28. Locally Finite Bruhat-Tits Buildings -- Chapter 29. Appendix A -- Chapter 30. Appendix B -- Bibliography -- Index |
| Record Nr. | UNINA-9910780926103321 |
|
Weiss Richard M (Richard Mark), <1946->
|
||
| Princeton, N.J., : Princeton University Press, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||