Link Prediction for Egocentrically Sampled Networks
From MaRDI portal
Abstract: Link prediction in networks is typically accomplished by estimating or ranking the probabilities of edges for all pairs of nodes. In practice, especially for social networks, the data are often collected by egocentric sampling, which means selecting a subset of nodes and recording all of their edges. This sampling mechanism requires different prediction tools than the typical assumption of links missing at random. We propose a new computationally efficient link prediction algorithm for egocentrically sampled networks, which estimates the underlying probability matrix by estimating its row space. For networks created by sampling rows, our method outperforms many popular link prediction and graphon estimation techniques.
Cites work
- 1-bit matrix completion
- A critical threshold for design effects in network sampling
- An Exponential Family of Probability Distributions for Directed Graphs
- Centered graphs and the structure of ego networks
- Collective dynamics of `small-world' networks
- Consistency of spectral clustering in stochastic block models
- Consistency under sampling of exponential random graph models
- CUR matrix decompositions for improved data analysis
- Edge exchangeable models for interaction networks
- Estimating and understanding exponential random graph models
- Estimating network edge probabilities by neighbourhood smoothing
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- Inference and missing data
- Inference for social network models from egocentrically sampled data, with application to understanding persistent racial disparities in HIV prevalence in the US
- Latent Space Approaches to Social Network Analysis
- Markov Graphs
- Matrix completion from noisy entries
- Matrix estimation by universal singular value thresholding
- Modeling social networks from sampled data
- Network cross-validation by edge sampling
- Network cross-validation for determining the number of communities in network data
- Random Dot Product Graph Models for Social Networks
- Random forests
- Random networks, graphical models and exchangeability
- Relative-Error CUR Matrix Decompositions
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical analysis with missing data
- Test theory without an answer key
- The average distances in random graphs with given expected degrees
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(2)
This page was built for publication: Link Prediction for Egocentrically Sampled Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181401)
