3 papers
cs.SI2021
Empirical Characterization of Graph Sampling Algorithms
Muhammad Irfan Yousuf, Izza Anwer, Raheel Anwar
Graph sampling allows mining a small representative subgraph from a big graph. Sampling algorithms deploy different strategies to replicate the properties of a given graph in the s…
cs.DS2019
Weighted Edge Sampling for Static Graphs
Muhammad Irfan Yousuf, Raheel Anwar
Graph Sampling provides an efficient yet inexpensive solution for analyzing large graphs. While extracting small representative subgraphs from large graphs, the challenge is to cap…
cs.DS2019
Analysis of a Model for Generating Weakly Scale-free Networks
Raheel Anwar, Muhammad Irfan Yousuf, Muhammad Abid
It is commonly believed that real networks are scale-free and fraction of nodes with degree satisfies the power law . P…