Parameter identifiability in a class of random graph mixture models
From MaRDI portal
Publication:629100
DOI10.1016/j.jspi.2010.11.022zbMath1207.62010arXiv1006.0826OpenAlexW2964011955MaRDI QIDQ629100
John A. Rhodes, Catherine Matias, Elizabeth S. Allman
Publication date: 8 March 2011
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0826
Related Items (12)
Estimating multivariate latent-structure models ⋮ Powerful multiple testing of paired null hypotheses using a latent graph model ⋮ Uniform estimation in stochastic block models is slow ⋮ Sufficient and Necessary Conditions for the Identifiability of the $Q$-matrix ⋮ Identifying Latent Structures in Restricted Latent Class Models ⋮ Identifiability of large phylogenetic mixture models ⋮ Consistency of maximum-likelihood and variational estimators in the stochastic block model ⋮ Model-based clustering of time-evolving networks through temporal exponential-family random graph models ⋮ Weighted stochastic block model ⋮ Estimation of dense stochastic block models visited by random walks ⋮ Dynamic stochastic block models: parameter estimation and detection of changes in community structure ⋮ Convergence of the groups posterior distribution in latent or stochastic block models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overlapping stochastic block models with application to the French political blogosphere
- Fast online graph clustering via Erdős-Rényi mixture
- A comparison of algorithms for fitting the PARAFAC model
- Strategies for online inference of model-based clustering in large and growing networks
- Uncovering latent structure in valued graphs: a variational approach
- Identifiability of parameters in latent structure models with many observed variables
- More factors than subjects, tests and treatments: An indeterminacy theorem for canonical decomposition and individual differences scaling
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- A concise proof of Kruskal's theorem on tensor decomposition
- Model for Heterogeneous Random Networks Using Continuous Latent Variables and an Application to a Tree-Fungus Network
- Mixed membership stochastic blockmodels
- Mixture models and exploratory analysis in networks
- Non-uniqueness in probabilistic numerical identification of bacteria
- The Structure and Function of Complex Networks
- Estimation and Prediction for Stochastic Blockstructures
- New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models
- A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- Identifiability of Finite Mixtures
- Identifiability of Mixtures
- Identifiability of Mixtures of Product Measures
- Probabilistic Functions of Finite State Markov Chains
This page was built for publication: Parameter identifiability in a class of random graph mixture models
