Modeling heterogeneity in random graphs through latent space models: a selective review
From MaRDI portal
Publication:151320
DOI10.1051/proc/201447004zbMath1335.05002arXiv1402.4296OpenAlexW2964282966MaRDI QIDQ151320
Stéphane Robin, Catherine Matias, Stephane Robin, Catherine Matias
Publication date: December 2014
Published in: ESAIM: Proceedings and Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4296
Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Related Items (23)
The dynamic random subgraph model for the clustering of evolving networks ⋮ Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models ⋮ Powerful multiple testing of paired null hypotheses using a latent graph model ⋮ Asymptotics of score test in the generalized \(\beta\)-model for networks ⋮ A review of dynamic network models with latent variables ⋮ Hierarchical clustering with discrete latent variable models and the integrated classification likelihood ⋮ Poisson approximation of subgraph counts in stochastic block models and a graphon model ⋮ Testing for association in multiview network data ⋮ Characterization of expansion-related properties of modular graphs ⋮ A survey on model-based co-clustering: high dimension and estimation challenges ⋮ Embedded topics in the stochastic block model ⋮ Properties of the stochastic approximation EM algorithm with mini-batch sampling ⋮ Consistency and asymptotic normality of stochastic block models estimators from sampled data ⋮ Outlier detection in networks with missing links ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Unnamed Item ⋮ Model-based clustering of multiple networks with a hierarchical algorithm ⋮ Variational Inference for Stochastic Block Models From Sampled Data ⋮ The stochastic topic block model for the clustering of vertices in networks with textual edges ⋮ Adaptive estimation of nonparametric geometric graphs ⋮ ppsbm ⋮ Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges ⋮ Goodness of Fit of Logistic Regression Models for Random Graphs
This page was built for publication: Modeling heterogeneity in random graphs through latent space models: a selective review