New consistent and asymptotically normal parameter estimates for random-graph mixture models
From MaRDI portal
Abstract: Random graph mixture models are now very popular for modeling real data networks. In these setups, parameter estimation procedures usually rely on variational approximations, either combined with the expectation-maximisation ( extsc{em}) algorithm or with Bayesian approaches. Despite good results on synthetic data, the validity of the variational approximation is however not established. Moreover, the behavior of the maximum likelihood or of the maximum a posteriori estimators approximated by these procedures is not known in these models, due to the dependency structure on the variables. In this work, we show that in many different affiliation contexts (for binary or weighted graphs), estimators based either on moment equations or on the maximization of some composite likelihood are strongly consistent and -convergent, where is the number of nodes. As a consequence, our result establishes that the overall structure of an affiliation model can be caught by the description of the network in terms of its number of triads (order 3 structures) and edges (order 2 structures). We illustrate the efficiency of our method on simulated data and compare its performances with other existing procedures. A data set of cross-citations among economics journals is also analyzed.
Recommendations
- Parameter identifiability in a class of random graph mixture models
- Accuracy of variational estimates for random graph mixture models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- The method of moments and degree distributions for network models
Cited in
(29)- A stochastic block model for interaction lengths
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Dealing with reciprocity in dynamic stochastic block models
- Gaussian-based visualization of Gaussian and non-Gaussian-based clustering
- Weighted stochastic block model
- High-frequency estimation of the Lévy-driven graph Ornstein-Uhlenbeck process
- Limit theorems for distributions invariant under groups of transformations
- Hybrid maximum likelihood inference for stochastic block models
- Edgeworth expansions for network moments
- Uniform estimation in stochastic block models is slow
- Consistency and asymptotic normality of latent block model estimators
- Consistency and asymptotic normality of stochastic block models estimators from sampled data
- Estimation of undirected graph with finite mixture of nonparanormal distribution
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Accuracy of variational estimates for random graph mixture models
- Moment-based parameter estimation in binomial random intersection graph models
- Multi‐subject stochastic blockmodels with mixed effects for adaptive analysis of individual differences in human brain network cluster structure
- Parameter estimation in a 3‐parameter p‐star random graph model
- A survey on model-based co-clustering: high dimension and estimation challenges
- Estimating the parameters of the Waxman random graph
- Asymptotic theory in bipartite graph models with a growing number of parameters
- Parameter identifiability in a class of random graph mixture models
- Model-Based Clustering of Nonparametric Weighted Networks With Application to Water Pollution Analysis
- Clique and cycle frequencies in a sparse random graph model with overlapping communities
- A two-way clustering framework to identify disparities in multimorbidity patterns of mental and physical health conditions among Australians
- Detection of structurally homogeneous subsets in graphs
- Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models
This page was built for publication: New consistent and asymptotically normal parameter estimates for random-graph mixture models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632663)
