random graph

On the Estimation of Network Complexity: Dimension of Graphons JMLR 2021 On the Power of Edge Independent Graph Models NeurIPS 2021 On the Universality of Graph Neural Networks on Large Random Graphs NeurIPS 2021 Random Graph Matching with Improved Noise Robustness COLT 2021 Rate-Optimal Subspace Estimation on Random Graphs NeurIPS 2021 Convergence and Stability of Graph Convolutional Networks on Large Random Graphs NeurIPS 2020 From tree matching to sparse graph alignment COLT 2020 Maximum Likelihood Embedding of Logistic Random Dot Product Graphs AAAI 2020 Bayesian Graph Convolutional Neural Networks for Semi-Supervised Classification AAAI 2019 GraSPy: Graph Statistics in Python JMLR 2019 Planting trees in graphs, and finding them back COLT 2019 Random Clique Covers for Graphs with Local Density and Global Sparsity UAI 2019 Robustness of Spectral Methods for Community Detection COLT 2019 A Note on Quickly Sampling a Sparse Matrix with Low Rank Expectation JMLR 2018 Rates of Convergence of Spectral Methods for Graphon Estimation ICML 2018 Sparse Exchangeable Graphs and Their Limits via Graphon Processes JMLR 2018 Bayesian inference on random simple graphs with power law degree distributions ICML 2017 Two-Sample Tests for Large Random Graphs Using Network Statistics COLT 2017 Edge-exchangeable graphs and sparsity NeurIPS 2016 Estimating the Size of a Large Network and its Communities from a Random Sample NeurIPS 2016 Computational Lower Bounds for Community Detection on Random Graphs COLT 2015 Exceptional Rotations of Random Graphs: A VC Theory JMLR 2015 Preferential Attachment in Graphs with Affinities AISTATS 2015 Discovering Latent Network Structure in Point Process Data ICML 2014 Random Bayesian networks with bounded indegree AISTATS 2014