Estimating Sizes of Social Networks via Biased Sampling

DOI10.1080/15427951.2013.862883zbMath1465.91079OpenAlexW2026643042WikidataQ105583978 ScholiaQ105583978MaRDI QIDQ4985359

O. Somekh, Edo Liberty, Ioana A. Cosma, Liran Katzir

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2013.862883

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (7)

On the Complexity of Sampling Vertices Uniformly from a Graph ⋮ Estimating the size of a hidden finite set: large-sample behavior of estimators ⋮ Bias reduction in the population size estimation of large data sets ⋮ Estimating graph parameters with random walks ⋮ A distributed counting architecture for exploring the structure of anonymous active-passive networks ⋮ Interactive proofs for social graphs ⋮ Fastest random walk on a path

Cites Work

• Calculating statistics of complex networks through random walks with an application to the on-line social network bebo
• A note on extending Knuth's tree estimator to directed acyclic graphs
• Confidence intervals for the number of unseen types
• Population size estimation using local sample coverage for open populations.
• Random sampling from a search engine's index
• Estimating the Efficiency of Backtrack Programs
• Distinct Values Estimators for Power Law Distributions
• On the estimate of the size of a directed graph

This page was built for publication: Estimating Sizes of Social Networks via Biased Sampling