Repelling Curvature Via $$\epsilon -$$Repelling Laplacian on Positive Connected Signed Graphs
The Journal of Geometric Analysis · 2026-05 · 36 (5)
DOI: 10.1007/s12220-026-02420-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Geometric Analysis, online erschienen am 10.04.2026. Verfasst von Yong Lin und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
This paper defines a positive semidefinite operator called ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling Laplacian on any positive connected signed graph. ϵ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon $$\end{document} is an arbitrary positive number less than a constant ϵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon _0$$\end{document} related to the graph’s consensus problem. Then we use the pseudoinverse of ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling Laplacian to construct ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling cost as an analogue of graph’s effective resistance. Subsequently, we define some novel discrete curvatures on any positive connected signed graph called node and edge ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling curvature, as a generalization of resistance curvatures proposed by K. Devriendt et al.. Besides, we derive the corresponding Lichnerowicz inequalities. Moreover, it turns out that edge ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling curvature is no more than the Lin-Lu-Yau curvature based on ϵ-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\epsilon -$$\end{document}repelling cost of the underlying graph.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Lin, Y., & Wan, S. (2026). Repelling Curvature Via $$\epsilon -$$Repelling Laplacian on Positive Connected Signed Graphs. The Journal of Geometric Analysis, 36(5). https://doi.org/10.1007/s12220-026-02420-1
Vancouver
Lin Y, Wan S. Repelling Curvature Via $$\epsilon -$$Repelling Laplacian on Positive Connected Signed Graphs. The Journal of Geometric Analysis. 2026;36(5). doi:10.1007/s12220-026-02420-1
BibTeX
@article{Lin2026,
author = {Lin, Yong and Wan, Shi},
title = {Repelling Curvature Via $$\epsilon -$$Repelling Laplacian on Positive Connected Signed Graphs},
journal = {The Journal of Geometric Analysis},
year = {2026},
volume = {36},
number = {5},
doi = {10.1007/s12220-026-02420-1}
}
EUVIMED