Show simple item record

dc.contributor.authorArnold, NAen_US
dc.contributor.authorMondragón, RJen_US
dc.contributor.authorClegg, RGen_US
dc.date.accessioned2024-01-15T15:52:51Z
dc.date.issued2023-12-01en_US
dc.identifier.urihttps://qmro.qmul.ac.uk/xmlui/handle/123456789/93908
dc.description.abstractOften, due to prohibitively large size or to limits to data collecting APIs, it is not possible to work with a complete network dataset and sampling is required. A type of sampling which is consistent with Twitter API restrictions is uniform edge sampling. In this paper, we propose a methodology for the recovery of two fundamental network properties from an edge-sampled network: the degree distribution and the triangle count (we estimate the totals for the network and the counts associated with each edge). We use a Bayesian approach and show a range of methods for constructing a prior which does not require assumptions about the original network. Our approach is tested on two synthetic and three real datasets with diverse sizes, degree distributions, degree-degree correlations and triangle count distributions.en_US
dc.relation.ispartofApplied Network Scienceen_US
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.titleUsing a Bayesian approach to reconstruct graph statistics after edge samplingen_US
dc.typeArticle
dc.identifier.doi10.1007/s41109-023-00574-3en_US
pubs.issue1en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.volume8en_US
rioxxterms.funderDefault funderen_US
rioxxterms.identifier.projectDefault projecten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 3.0 United States
Except where otherwise noted, this item's license is described as Attribution 3.0 United States