Link Prediction for Egocentrically Sampled Networks
From MaRDI portal
Publication:6181401
DOI10.1080/10618600.2022.2163648arXiv1803.04084MaRDI QIDQ6181401
Elizaveta Levina, Yun-Jhong Wu, Ji Zhu, Tianxi Li
Publication date: 22 January 2024
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04084
Cites Work
- Unnamed Item
- Unnamed Item
- Inference for social network models from egocentrically sampled data, with application to understanding persistent racial disparities in HIV prevalence in the US
- CUR matrix decompositions for improved data analysis
- Network cross-validation by edge sampling
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Consistency under sampling of exponential random graph models
- Spectral clustering and the high-dimensional stochastic blockmodel
- Modeling social networks from sampled data
- Centered graphs and the structure of ego networks
- A critical threshold for design effects in network sampling
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Estimating and understanding exponential random graph models
- Test theory without an answer key
- Relative-Error $CUR$ Matrix Decompositions
- Markov Graphs
- An Exponential Family of Probability Distributions for Directed Graphs
- Inference and missing data
- Latent Space Approaches to Social Network Analysis
- Edge Exchangeable Models for Interaction Networks
- Statistical Analysis with Missing Data, Third Edition
- High-Dimensional Probability
- Random Networks, Graphical Models and Exchangeability
- 1-Bit matrix completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Collective dynamics of ‘small-world’ networks
- Estimating network edge probabilities by neighbourhood smoothing
- Random Dot Product Graph Models for Social Networks
- The average distances in random graphs with given expected degrees
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Random forests
