Sampling and estimation in large social networks
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Unbiased estimators and variance estimators of such graph parameters which can be given as dyad or triad counts are found and approximate formulae pertaining to large networks are given.
Abstract
An unknown network is modelled by a directed or undirected graph having vertices of different kinds. Partial information is available concerning the vertex labels and the edge occurrences within a simple random sample of vertices. Using this information we find unbiased estimators and variance estimators of such graph parameters which can be given as dyad or triad counts. In particular, we give approximate formulae pertaining to large networks.