Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs
Yu Li, Lizhu Sun, Changjiang Bu

TL;DR
This paper develops quadratic form representations for the Hessian matrices of resistance distance and Kirchhoff index in weighted graphs, providing explicit eigenvalue bounds and demonstrating strong convexity of the Kirchhoff index.
Contribution
It introduces formulas for the Hessian matrices of resistance distance and Kirchhoff index using generalized inverses, and analyzes their eigenvalues and convexity properties.
Findings
Derived explicit formulas for the Hessian matrices.
Established eigenvalue bounds based on graph parameters.
Proved strong convexity of the Kirchhoff index under certain conditions.
Abstract
Let be a positive-weighted graph with the weight for all . The weighted graph is called a hyper-dual number weighted graph, where the weight is a hyper dual number, is a real number, and are two dual units, . In this paper, we give a representation for the Moore-Penrose inverse of the Laplacian matrix, and calculation formulas for the resistance distance and Kirchhoff index of , respectively. We establish quadratic forms of the Hessian matrices for the resistance distance and Kirchhoff index of via generalized matrix inverses. We further derive explicit bounds on the eigenvalues of the Hessian matrices for the resistance distance and the Kirchhoff index of in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Complex Network Analysis Techniques
