Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees.
Mikhail V. GoubkoAlexander VeremyevPublished in: CoRR (2020)
Keyphrases
- singular value decomposition
- distance matrix
- weighted distance
- singular values
- coefficient matrix
- matrix representation
- eigenvalues and eigenvectors
- linear algebra
- square matrices
- data matrix
- low rank
- positive definite
- perturbation theory
- measurement matrix
- weight matrix
- heat kernel
- quadratic form
- decision trees
- tree edit distance
- projection matrices
- block diagonal
- positive semidefinite
- matrix inversion
- symmetric matrices
- projection matrix
- low rank approximation
- symmetric positive definite
- least squares
- distance measure
- covariance matrix
- correlation matrix
- rows and columns
- edge detection
- low rank matrix
- matrix multiplication
- pseudo inverse
- covariance matrices
- triangle inequality
- null space
- matrix completion
- sparse matrix
- linear systems
- distance transform
- factorization method
- tree structure
- distance function
- linear combination
- linear complementarity problem
- similarity measure