Spectral density of random graphs: convergence properties and application in model fitting

Random graph models are used to describe the complex structure of real-world networks in diverse fields of knowledge. Studying their behavior and fitting properties are still critical challenges, that in general, require model specific techniques. An important line of research is to develop generic methods able to fit and select the best model among a collection. Approaches based on spectral density (i.e., distribution of the graph adjacency matrix eigenvalues) are appealing for that purpose: they apply to different random graph models. Also, they can benefit from the theoretical background of random matrix theory. This work investigates the convergence properties of model fitting procedures based on the graph spectral density and the corresponding cumulative distribution function. We also review results on the convergence of the spectral density for the most widely used random graph models. Moreover, we explore through simulations the limits of these graph spectral density convergence results, particularly in the case of the block model, where only partial results have been established.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2018

Comparing large-scale graphs based on quantum probability theory

In this paper, a new measurement to compare two large-scale graphs based...
research
08/29/2017

Drawing Big Graphs using Spectral Sparsification

Spectral sparsification is a general technique developed by Spielman et ...
research
04/08/2021

Linear and Sublinear Time Spectral Density Estimation

We analyze the popular kernel polynomial method (KPM) for approximating ...
research
02/09/2018

Estimating the Spectral Density of Large Implicit Matrices

Many important problems are characterized by the eigenvalues of a large ...
research
09/02/2019

Random Graph Models and Matchings

In this paper we will provide an introductory understanding of random gr...
research
03/26/2021

Beyond the adjacency matrix: random line graphs and inference for networks with edge attributes

Any modern network inference paradigm must incorporate multiple aspects ...
research
07/05/2022

Probability density estimation for sets of large graphs with respect to spectral information using stochastic block models

For graph-valued data sampled iid from a distribution μ, the sample mome...

Please sign up or login with your details

Forgot password? Click here to reset