Du är här

Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure

Författare:
Publiceringsår: 1997
Språk: Engelska
Sidor: 75-100
Publikation/Tidskrift/Serie: Journal of Classification
Volym: 14
Dokumenttyp: Artikel

Sammanfattning

A statistical approach to a posteriori blockmodeling for graphs
is proposed. The model assumes that the vertices of the graph are partitioned into two unknown blocks and that the probability of an edge between two vertices depends only on the blocks to which they belong.
Statistical procedures are derived for estimating the probabilities of edges
and for predicting the block structure from observations of the edge pattern only. ML estimators can be computed using the EM algorithm, but this
strategy is practical only for small graphs. A Bayesian estimator,
based on Gibbs sampling, is proposed. This estimator is practical also
for large graphs. When ML estimators are used, the block structure can be
predicted based on predictive likelihood. When Gibbs sampling is used,
the block structure can be predicted from posterior predictive probabilities.

A side result is that when the number of vertices tends to infinity while
the probabilities remain constant, the block structure can be recovered
correctly with probability tending to 1.

Disputation

Nyckelord

  • Mathematics and Statistics
  • Colored graph
  • EM algorithm
  • Latent class model
  • Social networks
  • Gibbs sampling

Övriga

Published
Yes
  • ISSN: 0176-4268

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

 

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen