Estimating sizes of social networks via biased sampling
From MaRDI portal
Publication:4985359
DOI10.1080/15427951.2013.862883zbMATH Open1465.91079OpenAlexW2026643042WikidataQ105583978 ScholiaQ105583978MaRDI QIDQ4985359FDOQ4985359
Authors: Liran Katzir, Edo Liberty, O. Somekh, Ioana A. Cosma 
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
Recommendations
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- Fast low-cost estimation of network properties using random walks
- How large is your graph?
- Sampling social networks using shortest paths
- Fast Low-Cost Estimation of Network Properties Using Random Walks
Cites Work
- Estimating the Efficiency of Backtrack Programs
- Confidence intervals for the number of unseen types
- 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
- Random sampling from a search engine's index
- Population size estimation using local sample coverage for open populations.
- Distinct Values Estimators for Power Law Distributions
- On the estimate of the size of a directed graph
Cited In (13)
- On the question of effective sample size in network modeling: an asymptotic inquiry
- A distributed counting architecture for exploring the structure of anonymous active-passive networks
- Efficient respondents selection for biased survey using online social networks
- Interactive proofs for social graphs
- Sampling social networks using shortest paths
- Bias reduction in the population size estimation of large data sets
- Estimating graph parameters with random walks
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- Efficient respondents selection for biased survey using homophily-high social relation graph
- On the Complexity of Sampling Vertices Uniformly from a Graph
- Fastest random walk on a path
- Estimating the size of a hidden finite set: large-sample behavior of estimators
- Estimating population size using the network scale up method
This page was built for publication: Estimating sizes of social networks via biased sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985359)
