Topological and Algebraic Properties of Chernoff Information between Gaussian Graphs

12/28/2017
by   Binglin Li, et al.
0

In this paper, we want to find out the determining factors of Chernoff information in distinguishing a set of Gaussian graphs. We find that Chernoff information of two Gaussian graphs can be determined by the generalized eigenvalues of their covariance matrices. We find that the unit generalized eigenvalue doesn't affect Chernoff information and its corresponding dimension doesn't provide information for classification purpose. In addition, we can provide a partial ordering using Chernoff information between a series of Gaussian trees connected by independent grafting operations. With the relationship between generalized eigenvalues and Chernoff information, we can do optimal linear dimension reduction with least loss of information for classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2017

Chernoff Information between Gaussian Trees

In this paper, we aim to provide a systematic study of the relationship ...
research
09/09/2023

Eigenvalues of some classes of signed complete graphs

In this work, we discuss some properties of the eigenvalues of some clas...
research
07/11/2019

Integer Laplacian Eigenvalues of Chordal Graphs

In this paper, structural properties of chordal graphs are analysed, in ...
research
04/29/2020

A generalized information criterion for high-dimensional PCA rank selection

Principal component analysis (PCA) is the most commonly used statistical...
research
10/11/2022

Descriptive complexity of the generalized spectra of graphs

Two graphs are cospectral if their respective adjacency matrices have th...
research
10/31/2019

Order Determination for Spiked Models

Motivated by dimension reduction in regression analysis and signal detec...

Please sign up or login with your details

Forgot password? Click here to reset