Corpus ID: 12278288

A Consistent Histogram Estimator for Exchangeable Graph Models

@inproceedings{Chan2014ACH,
  title={A Consistent Histogram Estimator for Exchangeable Graph Models},
  author={S. Chan and E. Airoldi},
  booktitle={ICML},
  year={2014}
}
  • S. Chan, E. Airoldi
  • Published in ICML 2014
  • Computer Science, Mathematics
  • Exchangeable graph models (ExGM) subsume a number of popular network models. The mathematical object that characterizes an ExGM is termed a graphon. Finding scalable estimators of graphons, provably consistent, remains an open issue. In this paper, we propose a histogram estimator of a graphon that is provably consistent and numerically efficient. The proposed estimator is based on a sorting-and-smoothing (SAS) algorithm, which first sorts the empirical degree of a graph, then smooths the… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Nonparametric estimation and testing of exchangeable graph models
    • 39
    • PDF
    Rate-optimal graphon estimation
    • 136
    • PDF
    Sampling and Estimation for (Sparse) Exchangeable Graphs
    • 26
    • PDF
    Private Graphon Estimation for Sparse Graphs
    • 48
    • PDF
    Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models
    • 25
    • PDF
    Rates of Convergence of Spectral Methods for Graphon Estimation
    • 28
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 48 REFERENCES
    Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
    • 127
    • PDF
    Estimation and Prediction for Stochastic Blockstructures
    • 917
    • PDF
    Nonparametric graphon estimation
    • 152
    • PDF
    Mixed Membership Stochastic Blockmodels
    • 1,658
    • PDF
    Limits of dense graph sequences
    • 656
    • Highly Influential
    • PDF
    Random function priors for exchangeable arrays with applications to graphs and relational data
    • 100
    • PDF
    Network histograms and universality of blockmodel approximation
    • 98
    • PDF
    Graphlet decomposition of a weighted network
    • 42
    • PDF