User:Rogério Brito/Books/Spectral Graph Theory
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Spectral Graph Theory
[edit]And Related Topics
[edit]- Matrix Fundamentals
- Moore–Penrose pseudoinverse
- Covariance matrix
- Positive-definite matrix
- Singular value decomposition
- Spectral theorem
- Diagonally dominant matrix
- Perron–Frobenius theorem
- Rayleigh quotient
- QR algorithm
- QR decomposition
- Householder transformation
- CUR matrix approximation
- Cayley–Hamilton theorem
- Block matrix pseudoinverse
- Proofs involving the Moore–Penrose pseudoinverse
- Eigendecomposition of a matrix
- Principal component analysis
- Stochastic Processes
- Markov chain
- Stochastic matrix
- Doubly stochastic matrix
- Graphs and Matrices
- Spectral graph theory
- Graph property
- Colin de Verdière graph invariant
- Adjacency matrix
- Laplacian matrix
- Algebraic connectivity
- Conductance (graph)
- Cheeger constant (graph theory)
- Polyhedral graph
- Strongly regular graph
- Applications of Spectral Graph Theory
- Spectral clustering
- Segmentation-based object categorization
- Expander graph
- PageRank
- Centrality in Graphs
- Centrality
- Betweenness centrality
- Katz centrality
- Resistance distance
- Eigenvalue algorithm
- HITS algorithm
- Cluster analysis
- Clustering coefficient
- Strength of a graph
- Factor analysis