Modeling covert network discovery as biased edge sampling – Assumptions and implications

Jonathan Januar, H. Colin Gallagher and Johan Koskinen

Network Science, 2026, vol. 14, -

Abstract: When collecting covert network data, researchers prioritize finding edges without confirming the absence of a tie. This suggests value in research on the process of sampling edges. However, little research has been done in this area. We use the line graph and the auto-logistic actor attribute model to systematically formulate biased sampling processes to reflect realistic sampling biases. We define what might be termed person of interest (POI) bias in the model to reflect the dependence between sampled edges. We present a few examples using different population networks. We conclude that biased sampling processes can result in highly structured observed networks even when the population network lacks structure.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:netsci:v:14:y:2026:i::p:-_18

Access Statistics for this article

More articles in Network Science from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().