Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models
From MaRDI portal
(Redirected from Publication:341136)
Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
Abstract: W-graph refers to a general class of random graph models that can be seen as a random graph limit. It is characterized by both its graphon function and its motif frequencies. In this paper, relying on an existing variational Bayes algorithm for the stochastic block models along with the corresponding weights for model averaging, we derive an estimate of the graphon function as an average of stochastic block models with increasing number of blocks. In the same framework, we derive the variational posterior frequency of any motif. A simulation study and an illustration on a social network complete our work.
Recommendations
- Accuracy of variational estimates for random graph mixture models
- Dynamic network models and graphon estimation
- Weighted stochastic block model
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- New consistent and asymptotically normal parameter estimates for random-graph mixture models
Cites work
- A nonparametric view of network models and Newman–Girvan and other modularities
- Accuracy of variational estimates for random graph mixture models
- Bayesian model averaging: A tutorial. (with comments and a rejoinder).
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Collective dynamics of `small-world' networks
- Community structure in social and biological networks
- Compound Poisson approximations of subgraph counts in random graphs
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Discrete small world networks
- Emergence of Scaling in Random Networks
- Estimation and Prediction for Stochastic Blockstructures
- Fast online graph clustering via Erdős-Rényi mixture
- Graph limits and exchangeable random graphs
- Limits of dense graph sequences
- Matrix estimation by universal singular value thresholding
- Multivariate sampling and the estimation problem for exchangeable arrays
- On numerical calculation of probabilities according to Dirichlet distribution
- Overlapping stochastic block models with application to the French political blogosphere
- Subsampling bootstrap of count features of networks
- The method of moments and degree distributions for network models
- The phase transition in inhomogeneous random graphs
- Uncovering latent structure in valued graphs: a variational approach
- Variational Bayes approach for model aggregation in unsupervised classification with Markovian dependency
- Variational Bayesian inference and complexity control for stochastic block models
Cited in
(10)- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Sampling and estimation for (sparse) exchangeable graphs
- scientific article; zbMATH DE number 7626706 (Why is no real title available?)
- Asymptotic analysis of a matrix latent decomposition model
- Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
- Estimation of Subgraph Densities in Noisy Networks
- Mixture models and networks: The stochastic blockmodel
- Black Box Variational Bayesian Model Averaging
- On sparsity, power-law, and clustering properties of graphex processes
- Stochastic Block Smooth Graphon Model
This page was built for publication: Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341136)
