{"id":32161838,"url":"https://github.com/ebanflo42/persistence","last_synced_at":"2025-10-21T13:59:10.761Z","repository":{"id":56842706,"uuid":"112888499","full_name":"Ebanflo42/Persistence","owner":"Ebanflo42","description":"A topological data analysis library for Haskell","archived":false,"fork":false,"pushed_at":"2021-03-16T13:46:57.000Z","size":1765,"stargazers_count":29,"open_issues_count":0,"forks_count":3,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-10-21T13:59:08.503Z","etag":null,"topics":["haskell","library","topological-data-analysis","topology"],"latest_commit_sha":null,"homepage":"","language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Ebanflo42.png","metadata":{"files":{"readme":"README.md","changelog":"changelog.md","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-12-03T00:32:53.000Z","updated_at":"2024-11-21T06:35:07.000Z","dependencies_parsed_at":"2022-08-29T12:40:37.428Z","dependency_job_id":null,"html_url":"https://github.com/Ebanflo42/Persistence","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/Ebanflo42/Persistence","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ebanflo42%2FPersistence","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ebanflo42%2FPersistence/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ebanflo42%2FPersistence/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ebanflo42%2FPersistence/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ebanflo42","download_url":"https://codeload.github.com/Ebanflo42/Persistence/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ebanflo42%2FPersistence/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":280272339,"owners_count":26302260,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-21T02:00:06.614Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["haskell","library","topological-data-analysis","topology"],"created_at":"2025-10-21T13:59:04.135Z","updated_at":"2025-10-21T13:59:10.754Z","avatar_url":"https://github.com/Ebanflo42.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Persistence\nA topological data analysis library for Haskell.\n\nThis library is motivated by flexibility when it comes to the type of data being analyzed. If your data comes with a meaningful binary function into into an ordered set, you can use Persistence to analyze your data. The library also provides functions for analyzing directed\\/undirected, weighted\\/unweighted graphs.\n\nVisit https://hackage.haskell.org/package/Persistence to see the documentation for the stable version. There is also documentation in each module.\n\nGitHub: https://github.com/Ebanflo42/Persistence\n\nIf you have the Haskell `stack` tool installed, compile and run tests with `stack test` (you may have to expose the modules `Util` and `Matrix` in the file `Persistence.cabal` to get it to work).\n\n# Update March 16 2021\n\nI do not plan on further developing this package; my research has taken me in directions which are rather far-removed from TDA.\n\nIf you came across this library because you are interested in TDA, check out the resources below.\n\nIf you came across this library because you are interested in a performant implementation of TDA in Haskell, this library will probably be dissatisfactory. Persistence 2 *works*, but it is written very naively using boxed vectors and often nested boxed vectors which get copied and rearranged an excessive amount during runtime. This library may be useful as a reference for the fundamental logic of a pure-functional implementation of algorithms in TDA, but in order for reasonable performance to be achieved it must be re-written using unboxed, probably mutable, arrays. I currently have no plans to perform this re-writing.\n\n# Learning about Topological Data Analysis\n\nComputing simplicial homology:\n\nhttps://jeremykun.com/2013/04/10/computing-homology/\n\nConstructing the Vietoris-Rips complex:\n\nhttps://pdfs.semanticscholar.org/e503/c24dcc7a8110a001ae653913ccd064c1044b.pdf\n\nConstructing the Cech complex:\n\nhttps://www.academia.edu/15228439/Efficient_construction_of_the_%C4%8Cech_complex\n\nComputing persistent homology:\n\nhttp://geometry.stanford.edu/papers/zc-cph-05/zc-cph-05.pdf\n\nThe algorithm for finding the directed clique complex is inspired by the pseudocode in the supplementary materials of this paper:\n\nhttps://www.frontiersin.org/articles/10.3389/fncom.2017.00048/full\n\nComputing and working with persistence landscapes:\n\nhttps://academic.csuohio.edu/bubenik_p/papers/persistenceLandscapes.pdf\n\n# Major TODOs:\n\n`Testing.hs`:\n\n1) More tests for Persistence landscape functions.\n\n2) Make some filtrations whose vertices don't all have index 0 and test persistent homology on them.\n\n`Filtration.hs`\n\n1) `indexBarCodes` and `indexBarCodesSimple` are both broken from the transition to unboxed vectors.\n\n`SimplicialComplex.hs`:\n\n1) Fix simplicial homology over the integers.\n\n2) Implement construction of the Cech complex (n points form an (n-1)-simplex if balls of a certain radius centered at each of the points intersect).\n\n3) Implement construction of the alpha-complex (sub-complex of the Delaunay triangulation where the vertices of every simplex are within a certain distance).\n\n`Matrix.hs`:\n\n1) This module ought to be completely rewritten for the sake of performance.\n\nSee each of the files for an overview of its inner-workings.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Febanflo42%2Fpersistence","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Febanflo42%2Fpersistence","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Febanflo42%2Fpersistence/lists"}