Metric Models for Random Graphs

Published

June 30, 1998

Author(s)

D L. Banks, G Constantine

Abstract

Many problems entail the analysis of data that are independent and identically distributed random graphs. Useful inference requires flexible probability models for such random graphs; these models should have interpretable location and scale parameters, and support the establishement of confidence regions, maximum likelihood estimates, goodness-of-fit tests, Bayesian inference, and an appropriate analogue of linear model theory. Banks and Carley (1994) develop a simple probability model and sketch some analyses; this paper extends that work so that analysts are able to choose models that reflect application-specific metrics on the set of graphs. The strategy applies to graphs, directed graphs, hypergraphs, and trees, and often extends to objects in countable metric spaces.

Citation

Journal of Classification

Volume

15

Pub Type

Journals

Download Paper

Local Download

Keywords

Bernoulli graphs, clustering, Gibbs distribution, Holland-Leinhardt models, phylogney, trees

Citation

Banks, D. and Constantine, G. (1998), Metric Models for Random Graphs, Journal of Classification, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151732 (Accessed October 16, 2025)