7 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.SI2018
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs
Guyue Han, Harish Sethu
Eigenvalues of a graph are of high interest in graph analytics for Big Data due to their relevance to many important properties of the graph including network resilience, community…
cs.SI2017★ 2 cited
On Counting Triangles through Edge Sampling in Large Dynamic Graphs
Guyue Han, Harish Sethu
Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related informatio…
cs.SI2016★ 7 cited
Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs
Guyue Han, Harish Sethu
Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest t…