Curvature-Distortion Numbers of Graphs: Prescribed Lin--Lu--Yau Curvature Lower Bounds

We study an optimization problem for weighted Lin–Lu–Yau curvature. Given a graph $G=(V,E)$ and a prescribed lower curvature bound $k\ge 0$, we ask for the smallest multiplicative distortion $$\text{Dist}(w):=\frac{\underset{e\in E}{\sup }{w}_e}{\underset{e\in E}{\inf }{w}_e}$$ of the edge weights needed to make every edge have curvature at least $k$. This leads to the family $${\text{DN}}_{\text{LLY}}^k(G):=\inf \{\text{Dist}(w):{\kappa }_{\text{LLY}}^w(e)\ge k\text{ for every }e\in E(G)\},$$ which extends the nonnegative-curvature invariant introduced in our preceding paper \cite{Xia2026InvariantI}. The edge weights change the transition probabilities, while the combinatorial graph distance remains fixed. Positive prescribed curvature leads to a fundamental distinction from the case $k=0$. If $G$ is a connected locally finite infinite graph and $k>0$, then $${\text{DN}}_{\text{LLY}}^k(G)=\mathrm{\infty }\mathrm{.}$$ Thus no finite multiplicative distortion of the edge weights can impose a uniform positive curvature lower bound on such a graph. For a finite tree $T$ with $m$ edges, such weights exist exactly when $k\le 2\mathrm{/}m$. We prove that the minimum distortion is attained by a weight unique up to scaling, and that the normalized minimizer and its distortion depend continuously and nondecreasingly on $k$. We then extend the finite-tree theory to general connected graphs. As an application, we characterize the graphs of girth at least six for which finite $k$-distortion is possible.