Cluster Inference by Using Transitivity Indices in Empirical Graphs

DOI10.2307/2287315MaRDI QIDQ4742162zbMATH OpenOpenAlexFDO

Authors Ove Frank, Frank Harary

Publication date 1982

Full work available at URL https://doi.org/10.2307/2287315

zbMATH Keywords

cluster structuresempirical graphsrandom graphsimilaritiestransitivity indices

Mathematics Subject Classification ID

Graph theory (05C99) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited in

(24)

• Identifiability of parameters in latent structure models with many observed variables
• Asymptotic normality of graph statistics
• Triad count statistics
• Same stats, different graphs (graph statistics and why we need graph drawings)
• Inferring sparse Gaussian graphical models with latent structure
• Model selection in overlapping stochastic block models
• Stochastic block models are a discrete surface tension
• Consistency and asymptotic normality of stochastic block models estimators from sampled data
• 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
• The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
• Asymptotic distributions in random graphs with applications to social networks
• Triad count estimation in digraphs
• Configuring random graph models with fixed degree sequences
• A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES
• Variational Bayesian inference and complexity control for stochastic block models
• Overlapping stochastic block models with application to the French political blogosphere
• Parameter identifiability in a class of random graph mixture models
• Nonparametric identification and estimation of stochastic block models from many small networks
• Model-based clustering in simple hypergraphs through a stochastic blockmodel
• Functional central limit theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
• Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models
• Fast online graph clustering via Erdős-Rényi mixture
• Variational Inference for Stochastic Block Models From Sampled Data

This page was built for publication: Cluster Inference by Using Transitivity Indices in Empirical Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742162)