[Paper Review] Curvature estimate on the finite graph with large girth

Yijin Gao|arXiv (Cornell University)|Sep 27, 2016

Geometric Analysis and Curvature Flows6 references3 citations

TL;DR

This paper establishes curvature estimates for finite, unweighted, locally finite graphs with girth greater than 5 using CD and CDE inequalities. By analyzing the Laplacian and higher-order gradient forms under the girth constraint, it proves that such graphs satisfy the CDE(2, -n/2 - 1) condition, providing a sharp lower bound on curvature that depends on the vertex degree n.

ABSTRACT

The CD inequalities and CDE inequalities are useful in the estimate of curvature on graphs. This article is based on the ufinite graph with large girth, and finally concludes some curvature estimate in CD and CDE.

Motivation & Objective

• To investigate curvature bounds on finite graphs with large girth using discrete curvature frameworks.
• To extend CD and CDE curvature inequalities to finite graphs with girth exceeding 5.
• To derive explicit curvature estimates under structural constraints such as large girth and unweighted edges.
• To establish a quantitative lower bound on curvature in terms of vertex degree n for graphs satisfying the CDE condition.

Proposed method

• Uses the unweighted normalized Laplacian on locally finite, connected, simple graphs with girth >5.
• Applies the CD(K,n) and CDE(K,n) curvature conditions via the Γ2 operator and higher-order gradient forms.
• Employs the Γi operators to express Γ2(f)(x) in terms of edge-weighted sums over neighborhoods and second-order differences.
• Imposes the girth >5 condition to eliminate short cycles, simplifying the neighborhood structure and enabling quadratic optimization over f-values on adjacent vertices.
• Assumes f(x)=1 and f(x,y_i)=v_i to reduce the CDE inequality to a function of the v_i values, enabling minimization under constraints.
• Uses quadratic function minimization and inequalities involving ∑v_i < 0 and v_i > -1 to derive the curvature lower bound.

Experimental results

Research questions

• RQ1 What curvature bounds can be established for finite graphs with girth greater than 5 using CD and CDE inequalities?
• RQ2 How does the absence of short cycles (girth >5) affect the structure of the Γ2 operator and curvature estimates?
• RQ3 Can a non-trivial lower curvature bound be derived for the CDE condition in such graphs, and if so, what is its dependence on vertex degree?
• RQ4 How do the values of f on neighboring vertices influence the curvature estimate under the CDE condition?
• RQ5 What role does the unweighted, locally finite structure play in enabling the curvature estimate?

Key findings

• The graph satisfies the CDE(2, -n/2 - 1) condition, where n is the degree of the central vertex x.
• The curvature bound depends on the vertex degree n and is sharp under the girth >5 assumption.
• The proof relies on minimizing a quadratic form in f-values on neighbors, with optimal values set at f(z_{1i}) = 2f(y_1) for i=1,…,k_1−1.
• The inequality ∑(2−k_i)/k_i ≥ k for all i implies that k ≤ min_i (2−k_i)/k_i, which is used to bound the curvature from below.
• The derivation shows that ∑v_i < 0 and v_i > -1 are critical constraints that allow the curvature lower bound to be bounded below by -n/2 -1.
• The final curvature estimate is derived by combining the Γ2(f) expression with the Γ(f, Γ(f)/f) term, leading to a lower bound involving ∑v_i and ∑v_i².