Comparing Massive Networks via Moment Matrices

Hayoung Choi, Yifei Shen, Yuanming Shi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, a novel similarity measure for comparing massive complex networks based on moment matrices is proposed. We consider the corresponding adjacency matrix of a graph as a real random variable of the algebraic probability space with a state. It is shown that the spectral distribution of the matrix can be expressed as a unique discrete probability measure. Then we use the geodesic distance between positive definite moment matrices for comparing massive networks. It is proved that this distance is graph invariant and sub-structure invariant. Numerical simulations demonstrate that the proposed method outperforms state-of-art method in collaboration network classification and its computational cost is extremely cheap.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages656-660
Number of pages5
ISBN (Print)9781538647806
DOIs
StatePublished - 15 Aug 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June
ISSN (Print)2157-8095

Conference

Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/TerritoryUnited States
CityVail
Period17/06/1822/06/18

Fingerprint

Dive into the research topics of 'Comparing Massive Networks via Moment Matrices'. Together they form a unique fingerprint.

Cite this