The Cactus Criterion: When Nonlinear Hodge Theory Reduces to Linear on Graphs

Abstract

Let G be a finite connected simple graph with a chosen orientation of its edges. For the edge potential (t)= t-1, we minimize Σe∈ E(ze) over each affine class ω+dC0(G)⊂ C1(G). The minimizer is the unique representative satisfying the nonlinear coclosed equation δ z=0, and hence defines a nonlinear selector :C1(G) C1(G). We show that is real analytic, identify its image as ==arsinh(δ), and compute its differential as a weighted Hodge projector. In particular, agrees with the ordinary Hodge projector to first order at the origin, and the first nonlinear correction is cubic. Our main global theorem is a graph-theoretic criterion: for every admissible edge potential -- even, C2, strictly convex, and non-quadratic -- the associated nonlinear selector coincides with on all of C1(G) if and only if G is a cactus graph. Finally, we work out the two-triangle graph, the smallest connected simple obstruction, and record a self-concordant Newton method for computing .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…