Estimation of Subgraph Densities in Noisy Networks

DOI10.1080/01621459.2020.1778482zbMath1506.62301arXiv1803.02488OpenAlexW3033442028MaRDI QIDQ5881090

Qiwei Yao, Jinyuan Chang, Eric D. Kolaczyk

Publication date: 9 March 2023

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

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

zbMATH Keywords

bootstrapgraphmethod of momentstrianglesedge densitytwo-stars

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed systems (68M14)

Related Items (1)

Covariate-Informed Latent Interaction Models: Addressing Geographic & Taxonomic Bias in Predicting Bird–Plant Interactions

Cites Work

• Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
• Statistical analysis of network data. Methods and models
• Dynamic network models and graphon estimation
• Matrix estimation by universal singular value thresholding
• A User’s Guide to Network Analysis in R
• Network-based Auto-probit Modeling for Protein Function Prediction
• Random-Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs
• Approximation of the difference of two Poisson-like counts by Skellam
• Statistical Analysis of Network Data with R
• On the Propagation of Low-Rate Measurement Error to Subgraph Counts in Large Networks

This page was built for publication: Estimation of Subgraph Densities in Noisy Networks