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.
Applied and Computational Matrix Analysis : MAT-TRIAD, Coimbra, Portugal, September 2015 : Selected, Revised Contributions / Natália Bebiano editor
| Applied and Computational Matrix Analysis : MAT-TRIAD, Coimbra, Portugal, September 2015 : Selected, Revised Contributions / Natália Bebiano editor |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xiii, 347 p. : ill. ; 24 cm |
| Soggetto topico |
16-XX - Associative rings and algebras [MSC 2020]
18-XX - Category theory; homological algebra [MSC 2020] 47-XX - Operator theory [MSC 2020] 05-XX - Combinatorics [MSC 2020] 15-XX - Linear and multilinear algebra; matrix theory [MSC 2020] |
| Soggetto non controllato |
Birkhoff polynomial basis
Computational complexity Covariance matrix Dual of convolutional codes Hankel pencil conjecture Interval linear algebra Matrix linear pencils Matrix theory Numerical range Spectral graph theory Spectral moments |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0123431 |
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Applied and Computational Matrix Analysis : MAT-TRIAD, Coimbra, Portugal, September 2015 : Selected, Revised Contributions / Natália Bebiano editor
| Applied and Computational Matrix Analysis : MAT-TRIAD, Coimbra, Portugal, September 2015 : Selected, Revised Contributions / Natália Bebiano editor |
| Pubbl/distr/stampa | Cham, : Springer, 2017 |
| Descrizione fisica | xiii, 347 p. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
15-XX - Linear and multilinear algebra; matrix theory [MSC 2020] 16-XX - Associative rings and algebras [MSC 2020] 18-XX - Category theory; homological algebra [MSC 2020] 47-XX - Operator theory [MSC 2020] |
| Soggetto non controllato |
Birkhoff polynomial basis
Computational complexity Covariance matrix Dual of convolutional codes Hankel pencil conjecture Interval linear algebra Matrix linear pencils Matrix theory Numerical range Spectral graph theory Spectral moments |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00123431 |
| Cham, : Springer, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
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 | ||
| ||
Graphs and Discrete Dirichlet Spaces / Matthias Keller, Daniel Lenz, Radosław K. Wojciechowski
| Graphs and Discrete Dirichlet Spaces / Matthias Keller, Daniel Lenz, Radosław K. Wojciechowski |
| Autore | Keller, Matthias |
| Pubbl/distr/stampa | Cham, : Springer, 2021 |
| Descrizione fisica | xv, 668 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Lenz, Daniel
Wojciechowski, Radosław K. |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
60J65 - Brownian motion [MSC 2020] 35K05 - Heat equation [MSC 2020] 58J65 - Diffusion processes and stochastic analysis on manifolds [MSC 2020] 05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020] 05C65 - Hypergraphs [MSC 2020] 05C63 - Infinite graphs [MSC 2020] |
| Soggetto non controllato |
Dirichlet forms
Graph Laplacian Heat equation on graphs Intrinsic metrics Markov semigroups Schrödinger Operators Spectral graph theory Stochastic Completeness |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0274806 |
|
Keller, Matthias
|
||
| Cham, : Springer, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Graphs and Discrete Dirichlet Spaces / Matthias Keller, Daniel Lenz, Radosław K. Wojciechowski
| Graphs and Discrete Dirichlet Spaces / Matthias Keller, Daniel Lenz, Radosław K. Wojciechowski |
| Autore | Keller, Matthias |
| Pubbl/distr/stampa | Cham, : Springer, 2021 |
| Descrizione fisica | xv, 668 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Lenz, Daniel
Wojciechowski, Radosław K. |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020] 05C63 - Infinite graphs [MSC 2020] 05C65 - Hypergraphs [MSC 2020] 35K05 - Heat equation [MSC 2020] 58J65 - Diffusion processes and stochastic analysis on manifolds [MSC 2020] 60J65 - Brownian motion [MSC 2020] |
| Soggetto non controllato |
Dirichlet forms
Graph Laplacian Heat equation on graphs Intrinsic metrics Markov semigroups Schrödinger Operators Spectral graph theory Stochastic Completeness |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00274806 |
|
Keller, Matthias
|
||
| Cham, : Springer, 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Locating Eigenvalues in Graphs : Algorithms and Applications / Carlos Hoppen, David P. Jacobs, Vilmar Trevisan
| Locating Eigenvalues in Graphs : Algorithms and Applications / Carlos Hoppen, David P. Jacobs, Vilmar Trevisan |
| Autore | Hoppen, Carlos |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 136 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Jacobs, David P.
Trevisan, Vilmar |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020] 05C62 - Graph representations (geometric and intersection representations, etc.) [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] |
| Soggetto non controllato |
Adjacency matrix
Eigenvalue Graph algorithms Graphs Laplacian matrix Linear-time algorithm Spectral graph theory Spectrum Tree |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0277764 |
|
Hoppen, Carlos
|
||
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Locating Eigenvalues in Graphs : Algorithms and Applications / Carlos Hoppen, David P. Jacobs, Vilmar Trevisan
| Locating Eigenvalues in Graphs : Algorithms and Applications / Carlos Hoppen, David P. Jacobs, Vilmar Trevisan |
| Autore | Hoppen, Carlos |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 136 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Jacobs, David P.
Trevisan, Vilmar |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C50 - Graphs and linear algebra (matrices, eigenvalues, etc.) [MSC 2020] 05C62 - Graph representations (geometric and intersection representations, etc.) [MSC 2020] 05C70 - Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020] 05C75 - Structural characterization of families of graphs [MSC 2020] 05C85 - Graph algorithms (graph-theoretic aspects) [MSC 2020] |
| Soggetto non controllato |
Adjacency matrix
Eigenvalue Graph algorithms Graphs Laplacian matrix Linear-time algorithm Spectral graph theory Spectrum Tree |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00277764 |
|
Hoppen, Carlos
|
||
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Recent trends in combinatorics / Andrew Beveridge ... [et al.] editors
| Recent trends in combinatorics / Andrew Beveridge ... [et al.] editors |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | XIII, 778 p. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05Cxx - Graph theory [MSC 2020] 05Axx - Enumerative combinatorics [MSC 2020] 05Bxx - Designs and configurations [MSC 2020] 05Dxx - Extremal combinatorics [MSC 2020] |
| Soggetto non controllato |
Additive Combinatorics
Analytic combinatorics Combinatorial matrix theory Combinatorics Discrete dynamical systems Discrete geometry Enumerative Cominatorics Extremal combinatorics Geometric Combinatorics Graph theory Hamilton Cycles Posets Probabilistic Combinatorics Spectral graph theory Turan Problems |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0115309 |
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Recent trends in combinatorics / Andrew Beveridge ... [et al.] editors
| Recent trends in combinatorics / Andrew Beveridge ... [et al.] editors |
| Pubbl/distr/stampa | [Cham], : Springer, 2016 |
| Descrizione fisica | XIII, 778 p. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05Axx - Enumerative combinatorics [MSC 2020] 05Bxx - Designs and configurations [MSC 2020] 05Cxx - Graph theory [MSC 2020] 05Dxx - Extremal combinatorics [MSC 2020] |
| Soggetto non controllato |
Additive Combinatorics
Analytic combinatorics Combinatorial matrix theory Combinatorics Discrete dynamical systems Discrete geometry Enumerative Cominatorics Extremal combinatorics Geometric Combinatorics Graph theory Hamilton Cycles Posets Probabilistic Combinatorics Spectral graph theory Turan Problems |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00115309 |
| [Cham], : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||