Universal latent space model fitting for large networks with edge covariates

zbMATH Open1497.68432MaRDI QIDQ4969035FDOQ4969035

Authors: Zhuang Ma, Zongming Ma, Hongsong Yuan 

Publication date: 5 October 2020

Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/17-470.html

Recommendations

• Latent Space Approaches to Social Network Analysis
• Latent space models for dynamic networks
• A Review of Latent Space Models for Social Networks
• Latent space approaches to community detection in dynamic networks
• The geometry of continuous latent space models for network data

zbMATH Keywords

community detectionnonconvex optimizationprojected gradient descentnetwork with covariates

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Estimation in multivariate analysis (62H12) Nonconvex programming, global optimization (90C26) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Matrix completion from noisy entries
• Bi-cross-validation of the SVD and the nonnegative matrix factorization
• Phase retrieval via Wirtinger flow: theory and algorithms
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral clustering and the high-dimensional stochastic blockmodel
• A survey of statistical network models
• Introductory lectures on convex optimization. A basic course.
• Network cross-validation for determining the number of communities in network data
• Rate-optimal graphon estimation
• A proof of the block model threshold conjecture
• Matrix estimation by universal singular value thresholding
• Consistency of spectral clustering in stochastic block models
• Convexified modularity maximization for degree-corrected stochastic block models
• Mixed membership stochastic blockmodels
• Belief propagation, robust reconstruction and optimal recovery of block models
• Minimax rates of community detection in stochastic block models
• Community detection and stochastic block models: recent developments
• Reconstruction and estimation in the planted partition model
• 1-bit matrix completion
• Achieving optimal misclassification proportion in stochastic block models
• Random Dot Product Graph Models for Social Networks
• Bilinear Mixed-Effects Models for Dyadic Data
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Sparse principal component analysis and iterative thresholding
• Latent Space Approaches to Social Network Analysis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Fast community detection by SCORE
• Community detection in degree-corrected block models
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Exact Recovery in the Stochastic Block Model
• Community detection in networks with node features
• Oracle inequalities for network models and sparse graphon estimation
• Community detection in sparse networks via Grothendieck's inequality
• A tensor approach to learning mixed membership community models
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
• Matrix Completion From a Few Entries
• Connected components in random graphs with given expected degree sequences
• Universally consistent vertex classification for latent positions graphs
• Local minima and convergence in low-rank semidefinite programming
• Universal kernels
• An Algorithm for Restricted Least Squares Regression
• The spectrum of kernel random matrices
• Guaranteed Matrix Completion via Non-Convex Factorization
• Spectral properties of distance matrices
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Phase retrieval via matrix completion
• The spectrum of random inner-product kernel matrices
• Spectra of Euclidean random matrices
• Optimal estimation and completion of matrices with biclustering structures
• Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality

Cited In (19)

• A Time-Varying Network for Cryptocurrencies
• Directed Community Detection With Network Embedding
• Generalized latent space model for one-mode networks with awareness of two-mode networks
• Latent space models for dynamic networks
• A latent space model for multilayer network data
• A nonlinear matrix decomposition for mining the zeros of sparse data
• A probabilistic view of latent space graphs and phase transitions
• The geometry of continuous latent space models for network data
• Network Estimation by Mixing: Adaptivity and More
• Consistent Estimation of the Number of Communities via Regularized Network Embedding
• Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
• Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
• PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
• On the numerical computation of a class of latent space problems
• Joint Latent Space Model for Social Networks with Multivariate Attributes
• Improvements on SCORE, especially for weak signals
• Fallacy of data-selective inference in modelling networks
• Community detection in attributed collaboration network for statisticians
• Special invited paper: the SCORE normalization, especially for heterogeneous network and text data

Uses Software

• Wirtinger Flow

This page was built for publication: Universal latent space model fitting for large networks with edge covariates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969035)