Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
From MaRDI portal
Abstract: We introduce a unified framework, formulated as general latent space models, to study complex higher-order network interactions among multiple entities. Our framework covers several popular models in recent network analysis literature, including mixture multi-layer latent space model and hypergraph latent space model. We formulate the relationship between the latent positions and the observed data via a generalized multilinear kernel as the link function. While our model enjoys decent generality, its maximum likelihood parameter estimation is also convenient via a generalized tensor decomposition procedure.We propose a novel algorithm using projected gradient descent on Grassmannians. We also develop original theoretical guarantees for our algorithm. First, we show its linear convergence under mild conditions. Second, we establish finite-sample statistical error rates of latent position estimation, determined by the signal strength, degrees of freedom and the smoothness of link function, for both general and specific latent space models. We demonstrate the effectiveness of our method on synthetic data. We also showcase the merit of our method on two real-world datasets that are conventionally described by different specific models in producing meaningful and interpretable parameter estimations and accurate link prediction. We demonstrate the effectiveness of our method on synthetic data. We also showcase the merit of our method on two real-world datasets that are conventionally described by different specific models in producing meaningful and interpretable parameter estimations and accurate link prediction.
Cites work
- 1-bit matrix completion
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- A survey of statistical network models
- Coauthorship and citation networks for statisticians
- Common and individual structure of brain networks
- Community Detection in General Hypergraph Via Graph Embedding
- Community detection in networks with node features
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Consistency of spectral clustering in stochastic block models
- Consistency of spectral hypergraph partitioning under planted partition model
- Consistent community detection in multi-layer network data
- Detecting overlapping communities in networks using spectral methods
- Dynamic network models and graphon estimation
- Estimating a network from multiple noisy realizations
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Graph-based change-point detection
- Inference for multiple heterogeneous networks with a common invariant subspace
- Joint latent space models for network data with high-dimensional node variables
- Latent Space Approaches to Social Network Analysis
- Latent space models for dynamic networks
- Latent space models for multiplex networks with shared structure
- Learning from binary multiway data: probabilistic tensor decomposition and its statistical optimality
- Locality Statistics for Anomaly Detection in Time Series of Graphs
- Matrix Completion From a Few Entries
- Networks
- Nonparametric modeling of higher-order interactions via hypergraphons
- On polynomial time methods for exact low-rank tensor completion
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in the dynamic stochastic block model
- Statistical clustering of temporal networks through a dynamic stochastic block model
- Statistical inference on random dot product graphs: a survey
- Tensor Decompositions and Applications
- Tensor SVD: Statistical and Computational Limits
- The Geometry of Algorithms with Orthogonality Constraints
- Universal latent space model fitting for large networks with edge covariates
Cited in
(14)- Optimal clustering by Lloyd's algorithm for low-rank mixture model
- A Latent Space Model for Weighted Keyword Co-Occurrence Networks with Applications in Knowledge Discovery in Statistics
- Network embedding for bipartite networks with applications in interlocking directorates in Chinese companies
- Efficient Estimation for Longitudinal Networks via Adaptive Merging
- Semiparametric modeling and analysis for longitudinal network data
- Network-based modeling of emotional expressions for multiple cancers via a linguistic analysis of an online health community
- Spectral clustering on aggregated multilayer networks with covariates
- Variational inference for the latent shrinkage position model
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
- Online tensor learning: computational and statistical trade-offs, adaptivity and optimal regret
- Statistical inference for low-rank tensors: heteroskedasticity, subgaussianity, and applications
- Statistical inference in tensor completion: optimal uncertainty quantification and statistical-to-computational gaps
- Low rank convex clustering for matrix-valued observations
This page was built for publication: Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181402)
