Joint Network Topology Inference via a Shared Graphon Model
arXiv:2209.08223 · doi:10.1109/TSP.2022.3223523
Abstract
We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is a nonparametric model from which graphs of potentially different sizes can be drawn. The versatility of graphons allows us to tackle the joint inference problem even for the cases where the graphs to be recovered contain different number of nodes and lack precise alignment across the graphs. Our solution is based on combining a maximum likelihood penalty with graphon estimation schemes and can be used to augment existing network inference methods. The proposed joint network and graphon estimation is further enhanced with the introduction of a robust method for noisy graph sampling information. We validate our proposed approach by comparing its performance against competing methods in synthetic and real-world datasets.
arXiv comment15 pages, 9 figures. arXiv admin note: text overlap with arXiv:2202.05686
References in corpus (25)
- High-dimensional graphs and variable selection with the Lasso
- Discrete Signal Processing on Graphs
- Complex networks in climate dynamics - Comparing linear and nonlinear network construction methods
- Spectral clustering and the high-dimensional stochastic blockmodel
- Matrix estimation by Universal Singular Value Thresholding
- Learning graphs from data: A signal representation perspective
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Graph limits and exchangeable random graphs
- Stationary Graph Processes and Spectral Estimation
- Stochastic blockmodels with growing number of classes
- Rate-optimal graphon estimation
- Network histograms and universality of blockmodel approximation
- Nonparametric graphon estimation
- Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
- Node-Based Learning of Multiple Gaussian Graphical Models
- Centrality measures for graphons: Accounting for uncertainty in networks
- Regularized Estimation of Piecewise Constant Gaussian Graphical Models: The Group-Fused Graphical Lasso
- Simultaneous Clustering and Estimation of Heterogeneous Graphical Models
- A Consistent Histogram Estimator for Exchangeable Graph Models
- Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models
- Change-point detection in dynamic networks via graphon estimation
- Joint Inference of Multiple Graphs from Matrix Polynomials
- EM-Based Smooth Graphon Estimation Using Bayesian and Spline-Based Approaches
- rags2ridges: A One-Stop-Shop for Graphical Modeling of High-Dimensional Precision Matrices
- Efficient Variational Bayes Learning of Graphical Models with Smooth Structural Changes