Improved mixing time for k-subgraph sampling

Matsuno Ryuta
Matsuno Ryuta

SDM, pp. 568-576, 2020.

Cited by: 0|Bibtex|Views17|DOI:https://doi.org/10.1137/1.9781611976236.64
EI
Other Links: arxiv.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments