Smoothing graphons for modelling exchangeable relational data

DOI10.1007/S10994-021-06046-YMaRDI QIDQ2127231zbMATH OpenOpenAlexFDO

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

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)