Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition

Tamal K. Dey, Michał Lipiński, Andrew Haas

Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is…