Persistent Laplacians: properties, algorithms and implications
From MaRDI portal
(Redirected from Publication:5089724)
Abstract: We present a thorough study of the theoretical properties and devise efficient algorithms for the emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences) of simplicial complexes , which was independently introduced by Lieutier et al. and by Wang et al. In particular, in analogy with the non-persistent case, we first prove that the nullity of the -th persistent Laplacian equals the -th persistent Betti number of the inclusion . We then present an initial algorithm for finding a matrix representation of , which itself helps interpret the persistent Laplacian. We exhibit a novel relationship between the persistent Laplacian and the notion of Schur complement of a matrix which has several important implications. In the graph case, it both uncovers a link with the notion of effective resistance and leads to a persistent version of the Cheeger inequality. This relationship also yields an additional, very simple algorithm for finding (a matrix representation of) the -th persistent Laplacian which in turn leads to a novel and fundamentally different algorithm for computing the -th persistent Betti number for a pair which can be significantly more efficient than standard algorithms. Finally, we study persistent Laplacians for simplicial filtrations and present novel stability results for their eigenvalues. Our work brings methods from spectral graph theory, circuit theory, and persistent homology together with a topological view of the combinatorial Laplacian on simplicial complexes.
Recommendations
Cites work
- A Cheeger-type inequality on simplicial complexes
- A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse
- A generalized Schur complement for nonnegative operators on linear spaces
- A note on the isoperimetric constant
- Annotating simplices with a homology basis and its applications
- Computational topology. An introduction
- Computing persistent homology
- Erosion distance for generalized persistence modules
- Evolutionary de Rham-Hodge method
- Expander graphs and their applications
- General Cheeger inequalities for p-Laplacians on graphs
- Graph sparsification by effective resistances
- Harmonic functions and boundary value problems on a chain complex
- HERMES: persistent spectral graph software
- Higher Dimensional Cheeger Inequalities
- Higher dimensional discrete Cheeger inequalities
- Hodge Laplacians on graphs
- Homological connectivity of random k -dimensional complexes
- scientific article; zbMATH DE number 3872118 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 878889 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3035866 (Why is no real title available?)
- Induced graphs of uniform spanning forests
- Kron Reduction of Graphs With Applications to Electrical Networks
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Lx = b
- Multiscale projective coordinates via persistent cohomology of sparse filtrations
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On Extension of Effective Resistance with Application to Graph Laplacian Definiteness and Power Network Stability
- Persistent cohomology and circular coordinates
- Probability on trees and networks
- Shifted simplicial complexes are Laplacian integral
- Simplicial networks and effective resistance
- Spatiotemporal persistent homology for dynamic metric spaces
- Spectra of combinatorial Laplace operators on simplicial complexes
- Topological persistence and simplification
- Toward a spectral theory of cellular sheaves
Cited in
(23)- Homotopy continuation for the spectra of persistent Laplacians
- Neighborhood hypergraph model for topological data analysis
- Harmonic representatives in homology over arbitrary fields
- Persistent hyperdigraph homology and persistent hyperdigraph Laplacians
- Persistent path Laplacian
- Normalized Hodge Laplacian matrix and application to random walk on simplicial complexes
- Combinatorial and Hodge Laplacians: similarities and differences
- Random walks, conductance, and resistance for the connection graph Laplacian
- Persistent Dirac of paths on digraphs and hypergraphs
- ChatGPT for computational topology
- A generalization of the persistent Laplacian to simplicial maps
- The algebraic stability for persistent Laplacians
- Quantum persistent homology
- Morse theoretic signal compression and reconstruction on chain complexes
- Persistent Stanley-Reisner theory
- Persistent directed flag Laplacian
- Persistent sheaf Laplacians
- Persistent interaction topology in data analysis
- The persistent Laplacian of non-branching complexes
- Multi-scale symmetry analysis in molecular structures
- Topological sequence analysis of genomes: Delta complex approaches
- Tracking the persistence of harmonic chains: barcode and stability
- GBNL: graded Betti number learning of complex biological data
This page was built for publication: Persistent Laplacians: properties, algorithms and implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089724)
