Model-based clustering for random hypergraphs
From MaRDI portal
Recommendations
- A random graph model for clustering graphs
- Model-based clustering of large networks
- Model-based clustering for populations of networks
- scientific article; zbMATH DE number 3971865
- scientific article; zbMATH DE number 434898
- Model-based clustering for network data
- Computing the clustering coefficient of a random model of graphs
- Model-based clustering
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 777866 (Why is no real title available?)
- scientific article; zbMATH DE number 3290846 (Why is no real title available?)
- An Exponential Family of Probability Distributions for Directed Graphs
- Clustering criteria for discrete data and latent class models
- Critical random hypergraphs: the emergence of a giant set of identifiable vertices
- Estimating the dimension of a model
- Estimation and Prediction for Stochastic Blockstructures
- Exploratory latent structure analysis using both identifiable and unidentifiable models
- Latent Space Approaches to Social Network Analysis
- Maximum likelihood estimation via the ECM algorithm: A general framework
- On the chromatic number of a random hypergraph
- On the strength of connectedness of a random hypergraph
- Overlapping stochastic block models with application to the French political blogosphere
- Recommender systems research: a connection-centric survey
- The phase transition in a random hypergraph
- Who is the best connected scientist? A study of scientific coauthorship networks
- \(\beta\) models for random hypergraphs with a given degree sequence
Cited in
(4)
This page was built for publication: Model-based clustering for random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103857)