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 | ||
| ||
Pancyclic and bipancyclic graphs / John C. George, Abdollah Khodkar, W.D. Wallis
| Pancyclic and bipancyclic graphs / John C. George, Abdollah Khodkar, W.D. Wallis |
| Autore | George, John C. |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | XII, 108 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Khodkar, Abdollah
Wallis, Walter D. |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C38 - Paths and cycles [MSC 2020] 05C45 - Eulerian and Hamiltonian graphs [MSC 2020] |
| Soggetto non controllato |
Bipancyclic Graph
Bipartite graph Combinatorics Directed graph Edge-pancyclic Graph Cycle Hamiltonian graphs Minimal Bipancyclicity Minimal Pancyclicity Node-pancyclic Pancyclic graph Undirected graph Uniquely Pancyclic Graphs Vertex-pancyclic |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0115162 |
|
George, John C.
|
||
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Pancyclic and bipancyclic graphs / John C. George, Abdollah Khodkar, W.D. Wallis
| Pancyclic and bipancyclic graphs / John C. George, Abdollah Khodkar, W.D. Wallis |
| Autore | George, John C. |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | XII, 108 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Khodkar, Abdollah
Wallis, Walter D. |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C38 - Paths and cycles [MSC 2020] 05C45 - Eulerian and Hamiltonian graphs [MSC 2020] |
| Soggetto non controllato |
Bipancyclic Graph
Bipartite graph Combinatorics Directed graph Edge-pancyclic Graph Cycle Hamiltonian graphs Minimal Bipancyclicity Minimal Pancyclicity Node-pancyclic Pancyclic graph Undirected graph Uniquely Pancyclic Graphs Vertex-pancyclic |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00115162 |
|
George, John C.
|
||
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134), Volume 134 / / Louis H. Kauffman, Sostenes Lins
| Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134), Volume 134 / / Louis H. Kauffman, Sostenes Lins |
| Autore | Kauffman Louis H. |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (308 pages) : illustrations |
| Disciplina | 514/.224 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Knot theory
Three-manifolds (Topology) Invariants |
| Soggetto non controllato |
3-manifold
Addition Algorithm Ambient isotopy Axiom Backslash Barycentric subdivision Bijection Bipartite graph Borromean rings Boundary parallel Bracket polynomial Calculation Canonical form Cartesian product Cobordism Coefficient Combination Commutator Complex conjugate Computation Connected component (graph theory) Connected sum Cubic graph Diagram (category theory) Dimension Disjoint sets Disjoint union Elaboration Embedding Equation Equivalence class Explicit formula Explicit formulae (L-function) Factorial Fundamental group Graph (discrete mathematics) Graph embedding Handlebody Homeomorphism Homology (mathematics) Identity element Intersection form (4-manifold) Inverse function Jones polynomial Kirby calculus Knot theory Line segment Linear independence Matching (graph theory) Mathematical physics Mathematical proof Mathematics Maxima and minima Monograph Natural number Network theory Notation Numerical analysis Orientability Orthogonality Pairing Pairwise Parametrization Parity (mathematics) Partition function (mathematics) Permutation Poincaré conjecture Polyhedron Quantum group Quantum invariant Recoupling Recursion Reidemeister move Result Roger Penrose Root of unity Scientific notation Sequence Significant figures Simultaneous equations Smoothing Special case Sphere Spin network Summation Symmetric group Tetrahedron The Geometry Center Theorem Theory Three-dimensional space (mathematics) Time complexity Tubular neighborhood Two-dimensional space Vector field Vector space Vertex (graph theory) Winding number Writhe |
| ISBN | 1-4008-8253-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Chapter 1. Introduction -- Chapter 2. Bracket Polynomial, Temperley-Lieb Algebra -- Chapter 3. Jones-Wenzl Projectors -- Chapter 4. The 3-Vertex -- Chapter 5. Properties of Projectors and 3-Vertices -- Chapter 6. θ-Evaluations -- Chapter 7. Recoupling Theory Via Temperley-Lieb Algebra -- Chapter 8. Chromatic Evaluations and the Tetrahedron -- Chapter 9. A Summary of Recoupling Theory -- Chapter 10. A 3-Manifold Invariant by State Summation -- Chapter 11. The Shadow World -- Chapter 12. The Witten-Reshetikhin- Turaev Invariant -- Chapter 13. Blinks ↦ 3-Gems: Recognizing 3-Manifolds -- Chapter 14. Tables of Quantum Invariants -- Bibliography -- Index |
| Record Nr. | UNINA-9910154743003321 |
|
Kauffman Louis H.
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||