Estimating network edge probabilities by neighbourhood smoothing
From MaRDI portal
Publication:5384536
Recommendations
- Density estimation on a network
- Edge sampling and graph parameter estimation via vertex neighborhood accesses
- Network Estimation From Point Process Data
- Approximate estimation in a class of directed networks
- Approximating the distribution functions in stochastic networks
- Edge sampling based network embedding model
- Models of smoothing in dynamic networks
- Edge sampling using local network information
- Edgeworth expansions for network moments
- Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independen
Cited in
(42)- On semidefinite relaxations for the block model
- Network representation using graph root distributions
- Random graph asymptotics for treatment effect estimation under network interference
- Estimation of the parameters in an expanding dynamic network model
- Smoothing graphons for modelling exchangeable relational data
- Edgeworth expansions for network moments
- Network vector autoregression with individual effects
- Maximum likelihood estimation of sparse networks with missing observations
- Optimal graphon estimation in cut distance
- Test on stochastic block model: local smoothing and extreme value theory
- scientific article; zbMATH DE number 7626706 (Why is no real title available?)
- Iterative Collaborative Filtering for Sparse Matrix Estimation
- Nonparametric modeling of higher-order interactions via hypergraphons
- The impact of randomization in smoothing networks
- 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
- A comprehensive framework for link prediction in multiplex networks
- Network Inference Using the Hub Model and Variants
- GBTM: community detection and network reconstruction for noisy and time-evolving data
- Link predictions for incomplete network data with outcome misclassification
- Network Estimation by Mixing: Adaptivity and More
- Computational lower bounds for graphon estimation via low-degree polynomials
- Analysis of heterogeneous networks with unknown dependence structure
- Network-Based Neighborhood Regression
- Bootstrap-based statistical inference on the eigenvalues of weighted networks
- Local bootstrap for network data
- A simple and computationally trivial estimator for grouped fixed effects models
- Stochastic Block Smooth Graphon Model
- Multiway empirical likelihood
- Higher-Order Accurate Two-Sample Network Inference and Network Hashing
- Simultaneous Estimation of Connectivity and Dimensionality in Samples of Networks
- Joint estimation of edge probabilities for multi-layer networks via neighborhood smoothing
- Perturbation-robust predictive modeling of social effects by network subspace generalized linear models
- Spatially adaptive neighborhood smoothing for directed sparse graphons
- Community detection and network reconstruction with dependent connectivity from rich but noisy network data
- Community detection via an efficient nonconvex optimization approach based on modularity
This page was built for publication: Estimating network edge probabilities by neighbourhood smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384536)
