Estimating a graph from triad counts
- 1 April 1979
- journal article
- research article
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 9 (1) , 31-46
- https://doi.org/10.1080/00949657908810285
Abstract
An empirical graph [Ggrave] is described by a random graph model which generates [Ggrave] from an unknown graph G by independent removals and additions of edges. We consider the problem of estimating G by using the triad counts in [Ggrave], i.e. the numbers of different induced subgraphs of order three in [Ggrave]. We describe methods of estimating a transitive graph and a forest, and we indicate a possible approach for a general graph G.Keywords
This publication has 3 references indexed in Scilit:
- Sampling and estimation in large social networksSocial Networks, 1979
- Random directed graph distributions and the triad census in social networks†The Journal of Mathematical Sociology, 1977
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969