Graph sampling

Article English OPEN
Zhang, L.-C. ; Patone, M. (2017)

We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
  • Metrics
    views in OpenAIRE
    views in local repository
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    e-Prints Soton - IRUS-UK 0 23
Share - Bookmark

  • Download from
  • Cite this publication