Cluster Inference by Using Transitivity Indices in Empirical Graphs
From MaRDI portal
Publication:4742162
DOI10.2307/2287315zbMath0505.62043OpenAlexW4250971868MaRDI QIDQ4742162
Publication date: 1982
Full work available at URL: https://doi.org/10.2307/2287315
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (05C99)
Related Items (21)
Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models ⋮ Asymptotic distributions in random graphs with applications to social networks ⋮ Asymptotic normality of graph statistics ⋮ Triad count statistics ⋮ Parameter identifiability in a class of random graph mixture models ⋮ Inferring sparse Gaussian graphical models with latent structure ⋮ Consistency and asymptotic normality of stochastic block models estimators from sampled data ⋮ Same stats, different graphs (graph statistics and why we need graph drawings) ⋮ The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ Fast online graph clustering via Erdős-Rényi mixture ⋮ Overlapping stochastic block models with application to the French political blogosphere ⋮ Model selection in overlapping stochastic block models ⋮ Variational Inference for Stochastic Block Models From Sampled Data ⋮ Stochastic block models are a discrete surface tension ⋮ A BAYESIAN APPROACH TO MODELING STOCHASTIC BLOCKSTRUCTURES WITH COVARIATES ⋮ Variational Bayesian inference and complexity control for stochastic block models ⋮ Identifiability of parameters in latent structure models with many observed variables ⋮ Dynamic stochastic block models: parameter estimation and detection of changes in community structure ⋮ Triad count estimation in digraphs ⋮ Convergence of the groups posterior distribution in latent or stochastic block models
This page was built for publication: Cluster Inference by Using Transitivity Indices in Empirical Graphs
