Parameter identifiability in a class of random graph mixture models
From MaRDI portal
Abstract: We prove identifiability of parameters for a broad class of random graph mixture models. These models are characterized by a partition of the set of graph nodes into latent (unobservable) groups. The connectivities between nodes are independent random variables when conditioned on the groups of the nodes being connected. In the binary random graph case, in which edges are either present or absent, these models are known as stochastic blockmodels and have been widely used in the social sciences and, more recently, in biology. Their generalizations to weighted random graphs, either in parametric or non-parametric form, are also of interest in many areas. Despite a broad range of applications, the parameter identifiability issue for such models is involved, and previously has only been touched upon in the literature. We give here a thorough investigation of this problem. Our work also has consequences for parameter estimation. In particular, the estimation procedure proposed by Frank and Harary for binary affiliation models is revisited in this article.
Recommendations
- New consistent and asymptotically normal parameter estimates for random-graph mixture models
- scientific article; zbMATH DE number 568800
- Identifiability of large phylogenetic mixture models
- Identifiability of parameters in latent structure models with many observed variables
- Model for heterogeneous random networks using continuous latent variables and an application to a tree-fungus network
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3485819 (Why is no real title available?)
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- A comparison of algorithms for fitting the PARAFAC model
- A concise proof of Kruskal's theorem on tensor decomposition
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- Estimation and Prediction for Stochastic Blockstructures
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Fast online graph clustering via Erdős-Rényi mixture
- Identifiability of Finite Mixtures
- Identifiability of Mixtures
- Identifiability of Mixtures of Product Measures
- Identifiability of parameters in latent structure models with many observed variables
- Mixed membership stochastic blockmodels
- Mixture models and exploratory analysis in networks
- Model for heterogeneous random networks using continuous latent variables and an application to a tree-fungus network
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- New consistent and asymptotically normal parameter estimates for random-graph mixture models
- Non-uniqueness in probabilistic numerical identification of bacteria
- Overlapping stochastic block models with application to the French political blogosphere
- Probabilistic Functions of Finite State Markov Chains
- Statistical analysis of finite mixture distributions
- Strategies for online inference of model-based clustering in large and growing networks
- The Structure and Function of Complex Networks
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Uncovering latent structure in valued graphs: a variational approach
Cited in
(25)- Model-Based Clustering of Nonparametric Weighted Networks With Application to Water Pollution Analysis
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Powerful multiple testing of paired null hypotheses using a latent graph model
- Convergence of the groups posterior distribution in latent or stochastic block models
- New consistent and asymptotically normal parameter estimates for random-graph mixture models
- Sufficient and necessary conditions for the identifiability of the Q-matrix
- Estimation of undirected graph with finite mixture of nonparanormal distribution
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Uniform estimation in stochastic block models is slow
- Nonparametric identification and estimation of stochastic block models from many small networks
- Clique and cycle frequencies in a sparse random graph model with overlapping communities
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- Identifying Latent Structures in Restricted Latent Class Models
- An optimal lower bound on the number of variables for graph identification
- Identifiability of parametric random matrix models
- Sufficient and Necessary Graphical Conditions for MISO Identification in Networks With Observational Data
- Model-based clustering in simple hypergraphs through a stochastic blockmodel
- Weighted stochastic block model
- Identifiability of directed Gaussian graphical models with one latent source
- Estimation of dense stochastic block models visited by random walks
- Estimating multivariate latent-structure models
- Model for heterogeneous random networks using continuous latent variables and an application to a tree-fungus network
- Identifiability of large phylogenetic mixture models
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
- Identifiability of parameters in latent structure models with many observed variables
This page was built for publication: Parameter identifiability in a class of random graph mixture models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629100)
