Skip to content

Author

Meihao Liao

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs

Resistance distance computation is a fundamental problem in graph data management. To avoid the high latency of online evaluation, recent work builds offline indexes. Existing approaches, however, fall into two families with complementary weaknesses: loop-erased random-walk methods (e.g., LEIndex) are efficient on fa...

Mei-Hao Liao, Bao Xing, Rong-Hua Li et al. · 0 citations
Preprint Aug 2026

Classical and quantum spectral density estimation under local graph access

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 algorithm for $\varepsilon$-approximate spectral density estimation in the Wasserstein-1 distance, using $2^{O(1/\varepsilon)}$ local queries...

Rong-Hua Li, Mei-Hao Liao, Yi-Chun Yang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.