Network Estimation via Graphon With Node Features

  title={Network Estimation via Graphon With Node Features},
  author={Yi Su and Raymond K. W. Wong and T. C. Lee},
  journal={IEEE Transactions on Network Science and Engineering},
  • Yi Su, Raymond K. W. Wong, T. C. Lee
  • Published 2020
  • Computer Science, Mathematics
  • IEEE Transactions on Network Science and Engineering
  • One popular model for network analysis is the exchangeable graph model (ExGM), which is characterized by a two-dimensional function known as a graphon. Estimating an underlying graphon becomes the key of such analysis. Several nonparametric estimation methods have been proposed, and some are provably consistent. However, if certain useful features of the nodes (e.g., age and schools in a social network context) are available, none of these methods were designed to incorporate this source of… CONTINUE READING


    Nonparametric estimation and testing of exchangeable graph models
    • 40
    • PDF
    Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
    • 134
    • Highly Influential
    • PDF
    Estimating exponential random graph models using sampled network data via graphon
    • R. He, Tian Zheng
    • Computer Science
    • 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
    • 2016
    • 1
    Estimating network edge probabilities by neighborhood smoothing
    • 63
    • Highly Influential
    • PDF
    Network cross-validation by edge sampling
    • 39
    • PDF
    Community Detection in Networks with Node Features
    • 66
    • PDF
    Nonparametric graphon estimation
    • 158
    • PDF
    Network Cross-Validation for Determining the Number of Communities in Network Data
    • 97
    • PDF
    A Consistent Histogram Estimator for Exchangeable Graph Models
    • 63
    • Highly Influential
    • PDF