Variational Bayes model averaging for graphon functions and motif frequencies inference in W-graph models
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Oct 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2.
2 papers.
- 2022Joint Network Topology Inference via a Shared Graphon Modelcited by 11
- 2022Asymptotics of ℓ2 Regularized Network Embeddingscited by 0
- 2022Joint Network Topology Inference via a Shared Graphon Model17 Sep 2022
- 2022Asymptotics of ℓ2 Regularized Network Embeddings5 Jan 2022