Persistent homology of Morse decomposition in Markov chains based on combinatorial multivector fields
Abstract: In this paper, we introduce a novel persistence framework for Morse decompositions in Markov chains using combinatorial multivector fields. Our approach provides a structured method to analyze recurrence and stability in finite-state stochastic processes. In our setting filtrations are governed by transition probabilities rather than spatial distances. We construct multivector fields directly from Markov transition matrices, treating states and transitions as elements of a directed graph. By applying Morse decomposition to the induced multivector field, we obtain a hierarchical structure of invariant sets that evolve under changes in transition probabilities. This structure naturally defines a persistence diagram, where each Morse set is indexed by its topological and dynamical complexity via homology and Conley index dimensions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.