Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks

DOI10.1214/14-AOAS800zbMath1454.62058arXiv1305.4977OpenAlexW3102316600MaRDI QIDQ2349562

Yaonan Zhang, Bruce D. Spencer, Eric D. Kolaczyk

Publication date: 17 June 2015

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4977

zbMATH Keywords

networkinverse problemdegree distributionnetwork samplingconstrained penalized weighted least squares

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Sampling theory, sample surveys (62D05)

Related Items

Motif estimation via subgraph sampling: the fourth-moment phenomenon ⋮ Sampling Based Estimation of In-Degree Distribution for Directed Complex Networks ⋮ Horvitz-Thompson estimator under partial information with an application to network degree distribution ⋮ Impact of spatially constrained sampling of temporal contact networks on the evaluation of the epidemic risk ⋮ Using isotope composition and other node attributes to predict edges in fish trophic networks ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ A framework for imperfectly observed networks

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling social networks from sampled data
• Statistical analysis of network data. Methods and models
• Estimation of the number of vertices of different degrees in a graph
• On Smoothing Sparse Multinomial Data
• Generalized SURE for Exponential Families: Applications to Regularization
• On the bias of traceroute sampling

This page was built for publication: Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks