Pith. sign in

REVIEW 2 cited by

Persistent Topological Laplacians -- a Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.07563 v2 pith:3KBBM5FO submitted 2023-12-09 math.AT

classification math.AT
keywords topologicalpersistentlaplacianscomplexesdatahomologyanalysissurvey
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Persistent topological Laplacians constitute a new class of tools in topological data analysis (TDA). They are motivated by the necessity to address challenges encountered in persistent homology when handling complex data. These Laplacians combines multiscale analysis with topological techniques to characterize the topological and geometrical features of functions and data. Their kernels fully retrieve the topological invariants of corresponding persistent homology, while their non-harmonic spectra provide supplementary information. Persistent topological Laplacians have demonstrated superior performance over persistent homology in analyzing large-scale protein engineering datasets. In this survey, we offer a pedagogical review of persistent topological Laplacians formulated in various mathematical settings, including simplicial complexes, path complexes, flag complexes, digraphs, hypergraphs, hyperdigraphs, cellular sheaves, as well as $N$-chain complexes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Eigenvalue gaps of the Laplacian of random graphs

    math.PR 2024-12 conditional novelty 7.0 of 10

    For an Erdős-Rényi graph with fixed edge probability, the random graph Laplacian has simple spectrum with overwhelmingly high probability, with a quantitative n^{-3/2-o(1)} lower bound on the minimum gap.

  2. Category-Specific Topological Learning of Metal-Organic Frameworks

    q-bio.BM 2024-12 conditional novelty 5.0 of 10

    A descriptor-based model combining category-specific persistent homology with gradient boosting reports higher R2 than transformer baselines on eight MOF gas selectivity datasets, but the comparison uses non-identical...

Pith tools