13 citations · 13 across the 3 of their papers we have counts for
3 papers
math.NA2023
Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factor
Zhiqiang Liu, Wenjian Yu
Effective resistance, which originates from the field of circuits analysis, is an important graph distance in spectral graph theory. It has found numerous applications in various a…
cs.DS2022
Pursuing More Effective Graph Spectral Sparsifiers via Approximate Trace Reduction
Zhiqiang Liu, Wenjian Yu
Spectral graph sparsification aims to find ultra-sparse subgraphs which can preserve spectral properties of original graphs. In this paper, a new spectral criticality metric based…
cs.SI2021★ 13 cited
SketchNE: Embedding Billion-Scale Networks Accurately in One Hour
Yuyang Xie, Yuxiao Dong, Jiezhong Qiu +3
We study large-scale network embedding with the goal of generating high-quality embeddings for networks with more than 1 billion vertices and 100 billion edges. Recent attempts Lig…