Zusammenfassung

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.

Beschreibung

ScienceDirect.com - Social Networks - Sampling and estimation in large social networks

Links und Ressourcen

Tags