Search
Feedback
About UniCat 
Help
News
| Listing 1 - 3 of 3 |
Sort by
|
Book
ISBN: 3031116984 3031116976 Year: 2022 Publisher: Cham, Switzerland : Springer,
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Teoria de grafs --- Matrius (Matemàtica) --- Àlgebra de matrius --- Àlgebra matricial --- Càlcul de matrius --- Càlcul matricial --- Matrius (Àlgebra) --- Àlgebra abstracta --- Àlgebra universal --- Anàlisi multivariable --- Desigualtats matricials --- Diagrames de Feynman --- Grups modulars --- Jocs d'estratègia (Matemàtica) --- Matrius aleatòries --- Matrius disperses --- Programació lineal --- Anàlisi combinatòria --- Topologia --- Anàlisi de xarxes (Planificació) --- Arbres (Teoria de grafs) --- Matroides --- Teoria de Ramsey --- Xarxes de Petri --- Teoria de l'aparellament --- Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems
Multi
ISBN: 9783031116988 9783031116971 9783031116995 Year: 2022 Publisher: Cham Springer International Publishing
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
This book focuses on linear time eigenvalue location algorithms for graphs. This subject relates to spectral graph theory, a field that combines tools and concepts of linear algebra and combinatorics, with applications ranging from image processing and data analysis to molecular descriptors and random walks. It has attracted a lot of attention and has since emerged as an area on its own. Studies in spectral graph theory seek to determine properties of a graph through matrices associated with it. It turns out that eigenvalues and eigenvectors have surprisingly many connections with the structure of a graph. This book approaches this subject under the perspective of eigenvalue location algorithms. These are algorithms that, given a symmetric graph matrix M and a real interval I, return the number of eigenvalues of M that lie in I. Since the algorithms described here are typically very fast, they allow one to quickly approximate the value of any eigenvalue, which is a basic step in most applications of spectral graph theory. Moreover, these algorithms are convenient theoretical tools for proving bounds on eigenvalues and their multiplicities, which was quite useful to solve longstanding open problems in the area. This book brings these algorithms together, revealing how similar they are in spirit, and presents some of their main applications. This work can be of special interest to graduate students and researchers in spectral graph theory, and to any mathematician who wishes to know more about eigenvalues associated with graphs. It can also serve as a compact textbook for short courses on the topic.
Statistical science --- Algebra --- Discrete mathematics --- Mathematical statistics --- Computer science --- grafieken --- algebra --- lineaire algebra --- discrete wiskunde --- statistiek --- algoritmen
Book
ISBN: 9783031116988 9783031116971 9783031116995 Year: 2022 Publisher: Cham Springer International Publishing :Imprint: Springer
Abstract | Keywords | Export | Availability | Bookmark
Loading...Choose an application
- Reference Manager
- EndNote
- RefWorks (Direct export to RefWorks)
Statistical science --- Algebra --- Discrete mathematics --- Mathematical statistics --- Computer science --- grafieken --- algebra --- lineaire algebra --- discrete wiskunde --- statistiek --- algoritmen
| Listing 1 - 3 of 3 |
Sort by
|