Improved mixing time for k-subgraph sampling
SDM, pp. 568-576, 2020.
Understanding the local structure of a graph provides valuable insights about the underlying phenomena from which the graph has originated. Sampling and examining k-subgraphs is a widely used approach to understand the local structure of a graph. In this paper, we study the problem of sampling uniformly k-subgraphs from a given graph. W...More
PPT (Upload PPT)