Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models

DOI10.1007/s11222-015-9607-0zbMath1349.62081arXiv1310.6150OpenAlexW3103986532MaRDI QIDQ341136

Pierre Latouche, Stephane Robin

Publication date: 16 November 2016

Published in: Statistics and Computing (Search for Journal in Brave)

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

zbMATH Keywords

networkgraphonBayesian model averagingstochastic block model\(W\)-graphnetwork motif

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Social networks; opinion dynamics (91D30) Bayesian inference (62F15) Random graphs (graph-theoretic aspects) (05C80)

Related Items (9)

Estimation of Subgraph Densities in Noisy Networks ⋮ Asymptotic Analysis of a Matrix Latent Decomposition Model ⋮ Mixture models and networks: The stochastic blockmodel ⋮ Black Box Variational Bayesian Model Averaging ⋮ On sparsity, power-law, and clustering properties of graphex processes ⋮ Unnamed Item ⋮ Sampling and estimation for (sparse) exchangeable graphs ⋮ Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs

Cites Work

• Overlapping stochastic block models with application to the French political blogosphere
• The method of moments and degree distributions for network models
• Variational Bayes approach for model aggregation in unsupervised classification with Markovian dependency
• Limits of dense graph sequences
• Subsampling bootstrap of count features of networks
• Fast online graph clustering via Erdős-Rényi mixture
• Uncovering latent structure in valued graphs: a variational approach
• Multivariate sampling and the estimation problem for exchangeable arrays
• Bayesian model averaging: A tutorial. (with comments and a rejoinder).
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Classification and estimation in the stochastic blockmodel based on the empirical degrees
• On numerical calculation of probabilities according to Dirichlet distribution
• Consistent nonparametric estimation for heavy-tailed sparse graphs
• Matrix estimation by universal singular value thresholding
• Discrete small world networks
• A nonparametric view of network models and Newman–Girvan and other modularities
• Emergence of Scaling in Random Networks
• Graph limits and exchangeable random graphs
• Estimation and Prediction for Stochastic Blockstructures
• Community structure in social and biological networks
• Compound Poisson approximations of subgraph counts in random graphs
• Accuracy of variational estimates for random graph mixture models
• Variational Bayesian inference and complexity control for stochastic block models
• The phase transition in inhomogeneous random graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models