Smoothing graphons for modelling exchangeable relational data

DOI10.1007/S10994-021-06046-YOpenAlexW3195246021MaRDI QIDQ2127231FDOQ2127231

Authors: Yaqiong Li, Xuhui Fan, Ling Chen, Bin Li, S. A. Sisson 

Publication date: 20 April 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11159

zbMATH Keywords

Bayesian methodsgraphonexchangeable relational data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• A nonparametric view of network models and Newman–Girvan and other modularities
• Estimation and Prediction for Stochastic Blockstructures
• Spectral clustering and the high-dimensional stochastic blockmodel
• Pseudo-likelihood methods for community detection in large sparse networks
• Consistency of community detection in networks under degree-corrected stochastic block models
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Dynamic network models and graphon estimation
• Mixed membership stochastic blockmodels
• Particle Markov Chain Monte Carlo Methods
• Stochastic blockmodels with a growing number of classes
• Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
• Representations for partially exchangeable arrays of random variables
• A tensor approach to learning mixed membership community models
• Role of normalization in spectral clustering for stochastic blockmodels
• Advanced Lectures on Machine Learning
• Estimating network edge probabilities by neighbourhood smoothing

This page was built for publication: Smoothing graphons for modelling exchangeable relational data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127231)