Expand description
Compositional H0 and H1 persistence programs. Compositional, change-sensitive H0 and H1 persistence programs.
A program splits positive-dimensional persistence at articulation separators. It compiles each cyclic block into a reduction region and computes H0 on the complete active graph. An update rebuilds only cyclic blocks touched by changed weights. A topology or threshold-membership change rebuilds the complete program.
Structs§
- Basis
Transport - One exact equality between an old and new canonical basis vector.
- Class
Continuation - One path-relative class-space continuation record.
- Persistence
Program - Exact H0 and H1 program compiled over sparse graph atoms.
- Program
Atom Info - One atom in a compiled sparse persistence program.
- Program
Branch - One independently advanced program branch.
- Program
Checkpoint - Immutable state from which a program can be restored or branched.
- Program
Diagram State - Stateful diagram evaluation with lazy materialization of class spaces.
- Program
Diagram Update - Result of advancing a diagram-only program state.
- Program
Evaluation - Diagram-only evaluation from unchanged program certificates.
- Program
Event - One event reported by a program update.
- Program
Summary - Structural and algebraic size of a compiled program.
- Program
Update - Result of advancing a persistence program.
- Program
Work - Exact work charged to one program evaluation or update.
Enums§
- Continuation
Kind - Algebraic relation between class spaces across one update.
- Correspondence
Mode - Control over exact relations to the preceding class spaces.
- Program
Diagram Update Mode - How a diagram-only state produced an updated diagram.
- Program
Event Kind - Why a program update changed execution state.
- Program
Update Mode - How a program produced an updated result.