Shiping Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Shiping Liu has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Norbert Peyerimhoff
Department of Mathematical Sciences Mathematical Sciences and Computer Science Building Durham University Upper Mountjoy Campus Stockton Road
21 shared publications - Riikka Kangaslampi
Faculty of Information Technology and Communication Sciences, Tampere University, Finland
7 shared publications - Chuanyuan Ge
School of Mathematical Sciences University of Science and Technology of China Hefei China
6 shared publications - Jürgen Jost
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
6 shared publications - Kaizhe Chen
School of the Gifted Young, University of Science and Technology of China, Hefei, China
6 shared publications - Florentin Münch
MPI MiS Leipzig 04103 Leipzig Germany
5 shared publications
Latest Publications
- 3 August 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (1)
On Lichnerowicz sharp distance-regular graphs
- 3 August 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (1)
On Lichnerowicz sharp distance-regular graphs
- 10 April 2026
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 36 (5) , 170
Halin Graphs with Positive Lin-Lu-Yau Curvature
- 10 April 2026
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 36 (5) , 170
Halin Graphs with Positive Lin-Lu-Yau Curvature
- Top Cited Papers
- 21 March 2026
- Published by Springer Nature in Calculus of Variations and Partial Differential Equations
- Vol. 65 (4) , 136
Ricci curvature, diameter and eigenvalues of amply regular graphs
- 21 March 2026
- Published by Springer Nature in Calculus of Variations and Partial Differential Equations
- Vol. 65 (4) , 136
Top Cited PapersRicci curvature, diameter and eigenvalues of amply regular graphs
- Open Access
On Lichnerowicz sharp distance-regular graphs
The first non-zero Laplacian eigenvalue $λ_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $κ$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $λ_1=κ$ is called Lichnerowicz sharp. In this note, we completely classify all Lichnerowicz sharp distance-regular graphs. Our result substantially strengthens the corresponding classification by Cushing, Kamtue, Koolen, Liu, Münch, and Peyerimhoff (Adv. Math. 2020), which required an extra spectral condition. As a key preparatory step, we provide a classification of all amply regular Terwilliger graphs with positive Lin-Lu-Yau curvature, a result that is interesting of its own right.Open AccessOn Lichnerowicz sharp distance-regular graphs
The first non-zero Laplacian eigenvalue $λ_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $κ$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $λ_1=κ$ is called Lichnerowicz sharp. In this note, we completely classify all Lichnerowicz sharp distance-regular graphs. Our result substantially strengthens the corresponding classification by Cushing, Kamtue, Koolen, Liu, Münch, and Peyerimhoff (Adv. Math. 2020), which required an extra spectral condition. As a key preparatory step, we provide a classification of all amply regular Terwilliger graphs with positive Lin-Lu-Yau curvature, a result that is interesting of its own right. - Open Access
- 10 February 2026
- Published by Elsevier in SSRN Electronic Journal
A new proof of the Lemmens–Seidel conjecture
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an analysis involving forbidden subgraphs for the smallest Seidel eigenvalue $-5$. Our new proof is based on bounds on eigenvalue multiplicities of graphs with degree no larger than $14$. To control the maximum degree of the graph associated with equiangular lines, we employ a recent inequality of Balla derived by matrix projection techniques. Our strategy also leads to a new proof for the classical result obtained by Lemmens and Seidel in 1973 for the case where the common angle is $\arccos(1/3)$.- 10 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA new proof of the Lemmens–Seidel conjecture
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an analysis involving forbidden subgraphs for the smallest Seidel eigenvalue $-5$. Our new proof is based on bounds on eigenvalue multiplicities of graphs with degree no larger than $14$. To control the maximum degree of the graph associated with equiangular lines, we employ a recent inequality of Balla derived by matrix projection techniques. Our strategy also leads to a new proof for the classical result obtained by Lemmens and Seidel in 1973 for the case where the common angle is $\arccos(1/3)$. - 10 December 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 178, 104-117
Diameter bounds for distance-regular graphs via long-scale Ollivier Ricci curvature
- 10 December 2025
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 178, 104-117
Diameter bounds for distance-regular graphs via long-scale Ollivier Ricci curvature
- Open Access
A new proof of the Lemmens-Seidel conjecture
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an analysis involving forbidden subgraphs for the smallest Seidel eigenvalue $-5$. Our new proof is based on bounds on eigenvalue multiplicities of graphs with degree no larger than $14$. To control the maximum degree of the graph associated with equiangular lines, we employ a recent inequality of Balla derived by matrix projection techniques. Our strategy also leads to a new proof for the classical result obtained by Lemmens and Seidel in 1973 for the case where the common angle is $\arccos(1/3)$.Open AccessA new proof of the Lemmens-Seidel conjecture
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an analysis involving forbidden subgraphs for the smallest Seidel eigenvalue $-5$. Our new proof is based on bounds on eigenvalue multiplicities of graphs with degree no larger than $14$. To control the maximum degree of the graph associated with equiangular lines, we employ a recent inequality of Balla derived by matrix projection techniques. Our strategy also leads to a new proof for the classical result obtained by Lemmens and Seidel in 1973 for the case where the common angle is $\arccos(1/3)$. - 20 September 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (5) , 1-27
Monotonic Normalized Heat Diffusion for Distance-Regular Graphs with Classical Parameters of Diameter 3
- 20 September 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (5) , 1-27
Monotonic Normalized Heat Diffusion for Distance-Regular Graphs with Classical Parameters of Diameter 3
- Open Access
A generalized Cheeger inequality and the Steklov Problem on finite graphs
We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we get a sharp estimate for the first non-trivial Steklov eigenvalue via Escobar Cheeger constant. At the end, we extend Hassannezhad and Miclo's convergence result to non-reversible Markov chains via a different method based on resolvent convergence, answering one of their questions.
Open AccessA generalized Cheeger inequality and the Steklov Problem on finite graphs
We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we get a sharp estimate for the first non-trivial Steklov eigenvalue via Escobar Cheeger constant. At the end, we extend Hassannezhad and Miclo's convergence result to non-reversible Markov chains via a different method based on resolvent convergence, answering one of their questions.
- Open Access
Quantitative Obata's theorem in discrete setting
Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-Émery and the $d$-th non-zero Laplacian eigenvalue $λ_d$ close to $K$, with $d$ being the maximal combinatorial vertex degree of $G$, has an underlying combinatorial structure of the $d$-dimensional hypercube graph. Moreover, such a graph $G$ is close in terms of Frobenius distance to a properly weighted hypercube graph. Furthermore, we establish their closeness in terms of eigenfunctions. Our results can be viewed as discrete analogies of the almost rigidity theorem and quantitative Obata's theorem on Rimennian manifolds.Open AccessQuantitative Obata's theorem in discrete setting
Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-Émery and the $d$-th non-zero Laplacian eigenvalue $λ_d$ close to $K$, with $d$ being the maximal combinatorial vertex degree of $G$, has an underlying combinatorial structure of the $d$-dimensional hypercube graph. Moreover, such a graph $G$ is close in terms of Frobenius distance to a properly weighted hypercube graph. Furthermore, we establish their closeness in terms of eigenfunctions. Our results can be viewed as discrete analogies of the almost rigidity theorem and quantitative Obata's theorem on Rimennian manifolds.