Skip to content

Graph Sampling Strategies #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
tanmoyio opened this issue Aug 8, 2023 · 1 comment
Open

Graph Sampling Strategies #3

tanmoyio opened this issue Aug 8, 2023 · 1 comment

Comments

@tanmoyio
Copy link

tanmoyio commented Aug 8, 2023

What is sampling, why do we need different sampling strategies, some examples

Algorithms we should cover with source code-

  1. Uniform Random Sampling
  2. Snowball Sampling
  3. Forest Fire Sampling
  4. NodeRank Sampling
  5. Degree-Based Sampling
  6. Stratified Sampling
  7. Metropolis-Hastings Sampling
  8. Subgraph Sampling
  9. Min-cut Sampling
    More ??

Strengths and weaknesses of these algorithms, computational complexity, how to find well suited sampling strategy depending on the graph and its characteristics.
@tanmoyio tanmoyio self-assigned this Aug 8, 2023
@rjurney
Copy link
Contributor

rjurney commented Aug 8, 2023

@tanmoyio check out https://github.com/benedekrozemberczki/littleballoffur - you may be able to use and explain the algorithms there.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@rjurney @tanmoyio