Modeling heterogeneity in random graphs through latent space models: a\n selective review

2014/02/18 by Catherine Matias, Stéphane Robin, Matias, Catherine +1 · 7 citations
Physics and Astronomy · Computer Science · #Complex Network Analysis Techniques #Opinion Dynamics and Social Influence #Bayesian Methods and Mixture Models

paper · pdf · doi:10.48550/arxiv.1402.4296

Abstract

We present a selective review on probabilistic modeling of heterogeneity in\nrandom graphs. We focus on latent space models and more particularly on\nstochastic block models and their extensions that have undergone major\ndevelopments in the last five years.\n

Cited by

• Maximum Likelihood Estimation of Sparse Networks with Missing Observations
• On the Estimation of Network Complexity: Dimension of Graphons
• Model-free algorithms for fast node clustering in SBM type graphs and application to social role inference in animals
• Statistical clustering of temporal networks through a dynamic stochastic block model
• Spherical latent space models for social network analysis
• Variational Inference for Stochastic Block Models From Sampled Data
• Consistency and Asymptotic Normality of Stochastic Block Models\n Estimators from Sampled Data

Related

• Graphical Models: An Extension to Random Graphs, Trees, and Other Objects
• Random Graphs: Combinatorics, Complex Networks and Disordered Systems
• Random clique covers for graphs with local density and global sparsity
• Blockmodels: A R-package for estimating in Latent Block Model and\n Stochastic Block Model, with various probability functions, with or without\n covariates
• Random Graph Models and Matchings