Homotopy continuation for the spectra of persistent Laplacians
The Laplacian is a critical concept in network analysis and shape tasks. Given its limitation to a single scale of the data set, it was recently imbued with ideas from persistent homology, leading to the \(p\)-persistent \(q\)-combinatorial Laplacian of a simplicial complex. This construction, colloquially referred to as a \textit{persistent Laplacian} can be shown to be intricately linked to multi-scale topological information, such as the persistent Betti numbers of a data set. Motivated by the utility of persistent Laplacians, this paper presents a new way of calculating their spectral information, specifically, the roots of their characteristic polynomials, by homotopy continuation. Homotopy continuation addresses the problem of solving a system~\(f\) of polynomial equations by starting with an easy-to-solve system~\(g\), building a homotopy between~\(f\) and~\(g\), and, finally, tracking the roots of~\(g\) to those of~\(f\). The authors demonstrate the feasibility of this continuation method and provide empirical evidence of the utility of using spectral information from persistent Laplacians to characterise aromatic molecules, for instance.
- Persistent Laplacians: properties, algorithms and implications
- Spectra of combinatorial Laplace operators on simplicial complexes
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Persistent homology -- a survey
- Combinatorial presentation of multidimensional persistent homology
- A Bayesian Topological Framework for the Identification and Reconstruction of Subcellular Motion
- A topological approach for protein classification
- A topological measurement of protein compressibility
- Algorithm 795
- Computational topology. An introduction
- Computing Betti numbers via combinatorial Laplacians
- Computing spectra without solving eigenvalue problems
- Decoupled molecules with binding polynomials of bidegree \((n,2)\)
- Galois groups of Schubert problems via homotopy computation
- HERMES
- HERMES: persistent spectral graph software
- Hodge Laplacians on graphs
- Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Maximum likelihood for matrices with rank constraints
- Multiple stable steady states of a reaction-diffusion model on zebrafish dorsal-ventral patterning
- Numerical algebraic geometry and algebraic kinematics
- Numerically solving polynomial systems with Bertini
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Solution of polynomial systems derived from differential equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Topology and data
Uses Software
This page was built for publication: Homotopy continuation for the spectra of persistent Laplacians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072664)