Distance matrices perturbed by a Laplacian

Publication date: 11 December 2019

Abstract: Let

T

be a tree with

n

vertices. To each edge of

T

, we assign a weight which is a positive definite matrix of some fixed order, say,

s

. Let

D_{i j}

denote the sum of all the weights lying in the path connecting the vertices

i

and

j

of

T

. We now say that

D_{i j}

is the distance between

i

and

j

. Define

D := [D_{i j}]

, where

D_{i i}

is the

s i m e s s

null matrix and for

i e q j

,

D_{i j}

is the distance between

i

and

j

. Let

G

be an arbitrary connected weighted graph with

n

vertices, where each weight is a positive definite matrix of order

s

. If

i

and

j

are adjacent, then define

L_{i j} := - W_{i j}^{- 1}

, where

W_{i j}

is the weight of the edge

(i, j)

. Define

L_{i i} := s u m_{i e q j, j = 1}^{n} W_{i j}^{- 1}

. The Laplacian of

G

is now the

n s i m e s n s

block matrix

L := [L_{i j}]

. In this paper, we first note that

D^{- 1} - L

is always non-singular and then we prove that

D

and its perturbation

(D^{- 1} - L)^{- 1}

have many interesting properties in common.

This page was built for publication: Distance matrices perturbed by a Laplacian