Smoothing graphons for modelling exchangeable relational data

DOI10.1007/s10994-021-06046-yOpenAlexW3195246021MaRDI QIDQ2127231

Bin Li, Yaqiong Li, Ling Chen, Xuhui Fan, Scott 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

graphonBayesian methodsexchangeable relational data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Spectral clustering and the high-dimensional stochastic blockmodel
• Representations for partially exchangeable arrays of random variables
• 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
• Role of normalization in spectral clustering for stochastic blockmodels
• Stochastic blockmodels with a growing number of classes
• A nonparametric view of network models and Newman–Girvan and other modularities
• Mixed membership stochastic blockmodels
• Estimation and Prediction for Stochastic Blockstructures
• Particle Markov Chain Monte Carlo Methods
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Estimating network edge probabilities by neighbourhood smoothing
• Advanced Lectures on Machine Learning

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