Estimating network edge probabilities by neighbourhood smoothing
From MaRDI portal
Publication:5384536
DOI10.1093/biomet/asx042OpenAlexW2962719258WikidataQ59410898 ScholiaQ59410898MaRDI QIDQ5384536
Elizaveta Levina, Yuan Zhang, Ji Zhu
Publication date: 24 June 2019
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.08588
Related Items
Estimation of the parameters in an expanding dynamic network model, Smoothing graphons for modelling exchangeable relational data, Community detection via an efficient nonconvex optimization approach based on modularity, Edgeworth expansions for network moments, Iterative Collaborative Filtering for Sparse Matrix Estimation, Test on stochastic block model: local smoothing and extreme value theory, Modularity Maximization for Graphons, Inference for High-Dimensional Exchangeable Arrays, High-Order Joint Embedding for Multi-Level Link Prediction, Hypothesis testing for populations of networks, Directed Community Detection With Network Embedding, A Spectral-Based Framework for Hypothesis Testing in Populations of Networks, Learning sparse graphons and the generalized Kesten-Stigum threshold, Link Prediction for Egocentrically Sampled Networks, Network vector autoregression with individual effects, Maximum likelihood estimation of sparse networks with missing observations, Unnamed Item, On semidefinite relaxations for the block model, Network representation using graph root distributions, Optimal graphon estimation in cut distance, Random graph asymptotics for treatment effect estimation under network interference, Unnamed Item
