Implements the algorithm by Briefs and Bläser (2025) <https://openreview.net/forum?id=8PHOPPH35D>, based on the approach of Gupta and Bläser (2024) <doi:10.1609/aaai.v38i18.30023>. It determines, for a structural causal model (SCM) whose directed edges form a tree, whether each parameter is unidentifiable, 1-identifiable or 2-identifiable (other cases cannot occur), using a randomized algorithm with provable running time O(n^3 log^2 n).
| Version: | 1.0.0 |
| Imports: | Rcpp |
| LinkingTo: | Rcpp |
| Suggests: | gmp, testthat |
| Published: | 2025-11-07 |
| DOI: | 10.32614/CRAN.package.fasttreeid (may not be active yet) |
| Author: | Yasmine Briefs [aut, cre], Markus Bläser [aut] |
| Maintainer: | Yasmine Briefs <ybriefs at mpi-inf.mpg.de> |
| BugReports: | https://github.com/yasminebriefs/FastTreeID/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/yasminebriefs/FastTreeID |
| NeedsCompilation: | yes |
| CRAN checks: | fasttreeid results [issues need fixing before 2025-11-21] |
| Reference manual: | fasttreeid.html , fasttreeid.pdf |
| Package source: | fasttreeid_1.0.0.tar.gz |
| Windows binaries: | r-devel: not available, r-release: not available, r-oldrel: fasttreeid_1.0.0.zip |
| macOS binaries: | r-release (arm64): not available, r-oldrel (arm64): not available, r-release (x86_64): not available, r-oldrel (x86_64): not available |
Please use the canonical form https://CRAN.R-project.org/package=fasttreeid to link to this page.