PERSISTENT DIRECTED FLAG LAPLACIAN

Topological data analysis (TDA) has had enormous success in science and engineering in the past decade. Persistent topological Laplacians (PTLs) overcome some limitations of persistent homology, a key technique in TDA, and provide substantial insight to the behavior of various geometric and topologi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Foundations of data science Ročník 7; číslo 3; s. 737
Hlavní autori: Jones, Benjamin, Wei, Guo-Wei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States 01.09.2025
Predmet:
Persistent topological Laplacians
clique complex
directed flag Laplacians
Primary: 55N31
directed flag complex
topological data analysis
ISSN:2639-8001, 2639-8001
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Topological data analysis (TDA) has had enormous success in science and engineering in the past decade. Persistent topological Laplacians (PTLs) overcome some limitations of persistent homology, a key technique in TDA, and provide substantial insight to the behavior of various geometric and topological objects. This work extends PTLs to directed flag complexes, which are an exciting generalization to flag complexes, also known as clique complexes, that arise naturally in many situations. We introduce the directed flag Laplacian and show that the proposed persistent directed flag Laplacian (PDFL) is a distinct way of analyzing these flag complexes. Example calculations are provided to demonstrate the potential of the proposed PDFL in real world applications.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:2639-8001
2639-8001
DOI:10.3934/fods.2024048