The following comments are based on the paper-main_v3_2025.tex version on Overleaf.
Overall impression: Either I lack the prerequisite knowledge to read this paper, or the paper is unnecessarily abstract.
-
OHCP is NP-hard when working over or .
- Top dimensional complexes, -complex in , is solvable in over , where .
- The fastest algorithms for min-cost flow are almost linear: .
-
Contributions:
- Network flow model (min-cost flow) for OHPs over with -cycles as input in (codimension 1)
- Non-negative flow model (-flow)
-
Question: Why is the number of arcs not known apriori? “The number of arcs lies in the interval “
Background, Definitions, and Examples
-
Alexander duality theorem: Let be a -complex with . Then can be partitioned into voids , where is the unbounded outer void. That is, .
- Bijection between generators of , given by components of , and inner voids of : and corresponds to the boundary of the outer void .
-
Question: Text states , but Figure (2a) states that .
-
The and -simplices of are weighted by non-negative length-costs and area-costs .
- Denoted and
- We define for all
-
Cost functions:
- -cochain is -valued homomorphism on -simplices, .
- Groups of -chains and -cochains are isomorphic,
- The -coboundary operator given by for .
- Fundamental property of cohomology:
- The matrix representaiton is given by
- The generators of -boundaries are in 1-to-1 correspondence with -simplices: for all
- The homology and cohomology groups are isomorphics, , hence
- Hodge decomposition: Given a simplicial complex ,
- A -cycle is called a flow and the relation for all is called the flow conservation condition.
- Likewise, a -cocycle is called a coflow and for all cocycles is called the circulation conservation condition.
- One may view a -coflow as a function defined on -cycles, , which maps -boundaries to 0.
- Define the flux of through by
- Denote by a set of simple cycles that generate and
- The homology signature of a -cycle , is given by where , where .
Question: What is the point of if is always zero?
- We define a -copath from to , both in , to be a simple -cochain such that and and is 0 for any other -cycle.
- If and , then
Embedding and Dual Complex
-
Denote by , i.e., the set of inner voids.
-
Every embeddable complex is a weak pseudomanifold, i.e., every -simplex has at most two cofaces.
-
Embedability implies orientable
-
We require the simplices of to be consistently oriented:
- If, two -simplices share a -face then must be a positive face of one of them, and a negative face of the other, .
- Assume and . Then we denote the natural orientation of as with coboundary .
- We call and the left and right coface of respectively.
- By the left-hand rule, the positive faces of define a clockwise direction of curling along its boundary .
-
A dual complex of is given by the isomorphism for .
Comment: This is not clear to me.
- The idea of the dual complex is for the generators of to be in one-to-one correspondence with dual nodes and two arcs are given for each orientation of connecting -chains: and so that .
Comment: The above bullet is my understanding of Figure (3b).
- Define the acyclic complex .
- as
- The -th cohomology is trivial, but
- Define the dual graph, , as a 1-skeleton subcomplex of the dual complex
- The nodes correspond to -simplices and voids:
- For each oriented -simplex , , we add arcs and with weights given by the length-volume
- We split the set of arcs into positive/natural arcs and negative/reversed arcs:
Network Flow Model for OHCP
- Given -cycle , the OHCP seeks to find a -cycle of minimal cost
- We want to ensure that for any extension of , the LP gives a feasible solution in . That is, and for any and .
Question: Where does the dual formulation come from?
- By the lemmas, any -cycle in is a -boundary on .
- Define such that .
- The values of (known as -winding number) measures the direction and how many times each -facet is encircled by .
- Positive values correspond to encircling in a clockwise direction, negative counter-clockwise.
- Zero values correspond to the facets that are “outside” of .
Question: Unsure what the point of this sentence on homology signature is.
- One can measure the cost of sending units of flow along a copath by the endpoints:
-
The max-bounding chain problem is dual to the shortest path distance problem on the dual graph with costs given by the input -cycle.
-
Define to be a dual 0-cochain on the nodes of the dual graph which gives the shortest path distances from (node dual to outer void), to all other nodes.
- For any two nodes , the dual distance cochain satisfies .
-
The max-bounding chain LP on is given below:
Question: I don’t understand how this solves the max-bounding chain problem. But honestly, I’m completely lost in all the notation at this point. Right now my understanding is that we are representing the OHCP as an OHBP due to the lemmas stating that the -cycles on turn into -boundaries on . As an optimization problem, we’d state OHBP as follows:
We need our solution to be a -cycle in (and optimal), so for all . Even given that -cycles turn into -boundaries, I do not see how optimal solution to the above (assuming it’s even a -cycle) would give the solution to the OHCP.
- To optimize the flux of coflow through it is sufficient that the -coflow is non-zero only on the non-zero homology classes of .
Question: Why? I assume this is will be shown later?
- Let , and .
- Three cases:
- and : then is curling in CCW. So we set and . Question: but ?
- and : then is curling in CW. So we set and . Question: same as above.
- and : then is a mix of CW and CCW parts.
Comment: At this point I’ve spent almost 6 hours reading this paper (for the third time) and just now getting to the network flow model. Based purely on Figure 5, it feels like the majority of the past 14 pages of the paper were unnecessary to understand the model. Perhaps things could be shuffled around? Figure 5 should be much sooner and the other content pushed to later for the readers interested in why the model works.
I need a break and will have to return to the paper tomorrow. I’ll likely have forgotten most of it by then; especially the notation.