Performance of PC and Modified PC Algorithms of Graph Theoretic Approach: A Monte Carlo Simulation Study
Journal of Quantitative Methods · 29.06.2024 · 8 (1) · 1-24
DOI: 10.29145/jqm.81.01 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Quantitative Methods, online erschienen am 29.06.2024. Verfasst von Rizwan Fazal und 4 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Keeping in view the work of Swanson and Granger (1997) among others, the performance of PC algorithm and Modified PC algorithm of graph theoretic approach in term of size and power properties are evaluated using Monte Carlo simulation. The study recommends modified PC algorithm as the dominant approach to causality as it successfully expose the correct causal relationship between variables and best to differentiate between correct and spurious causality.
Zitieren
APA
Fazal, R., Rehman, A. U., Hamayat, F., Majeed, T., & Salita, S. (2024). Performance of PC and Modified PC Algorithms of Graph Theoretic Approach: A Monte Carlo Simulation Study. Journal of Quantitative Methods, 8(1), 1-24. https://doi.org/10.29145/jqm.81.01
Vancouver
Fazal R, Rehman AU, Hamayat F, Majeed T, Salita S. Performance of PC and Modified PC Algorithms of Graph Theoretic Approach: A Monte Carlo Simulation Study. Journal of Quantitative Methods. 2024;8(1):1-24. doi:10.29145/jqm.81.01
BibTeX
@article{Fazal2024,
author = {Fazal, Rizwan and Rehman, Atiq Ur and Hamayat, Faizan and Majeed, Tariq and Salita, Salita},
title = {Performance of PC and Modified PC Algorithms of Graph Theoretic Approach: A Monte Carlo Simulation Study},
journal = {Journal of Quantitative Methods},
year = {2024},
volume = {8},
number = {1},
pages = {1--24},
doi = {10.29145/jqm.81.01}
}
EUVIMED