5 papers
An algorithm for counting spanning trees by -regularized resistance
Rong-Hua Li, Yichun Yang
We study the basic problem of approximating the number of spanning trees of a graph. For a graph with vertices, edges, We propose an algorithm that approximates the number…
Classical and quantum spectral density estimation under local graph access
Rong-Hua Li, Meihao Liao, Yichun Yang
We study spectral density estimation for the normalized adjacency matrix of an unweighted graph under local access model. Previously, Cohen-Steiner et al. [KDD 2018] proposed an al…
Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
Yichun Yang, Longlong Lin, Rong-Hua Li +2
The computation of resistance distance is pivotal in a wide range of graph analysis applications, including graph clustering, link prediction, and graph neural networks. Despite it…
BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
Yueyang Pan, Meihao Liao, Rong-Hua Li
Biharmonic distance (\bd) is a powerful graph distance metric with many applications, including identifying critical links in road networks and mitigating over-squashing problem in…
Anti--labeling of graphs
Xiaxia Guan, Shurong Zhang, Rong-hua Li +2
It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti--labeling…