Star sampling with and without replacement

29 Sep 2019 Stokes Jonathan Weber Steven

Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star points). We consider the use of SS to find any member of a target set of vertices in a graph, where the figure of merit (cost) is either the expected number of samples (unit cost) or the expected number of star centers plus star points (linear cost) until a vertex in the target set is encountered, either as a star center or as a star point... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • NETWORKING AND INTERNET ARCHITECTURE
  • SOCIAL AND INFORMATION NETWORKS