[1] Barabási, A.-L. and Albert, R. (1999). Emergence of scaling in random networks. science, 286:509-512.
[2] Bello, K., Aragam, B., and Ravikumar, P. (2022). DAGMA: Learning DAGs via m-matrices and a log-determinant acyclicity characterization. In Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., and Oh, A., editors, Advances in Neural Information Processing Systems, volume 35, pages 8226-8239. Curran Associates, Inc.
[3] Camchong, J., Roediger, D., Fiecas, M., Gilmore, C. S., Kushner, M., Kummerfeld, E., Mueller, B. A., and Lim, K. O. (2023). Frontal tDCS reduces alcohol relapse rates by increasing connections from left dorsolateral prefrontal cortex to addiction networks. *Brain Stimulation*, 16:1032–1040.
[4] Chickering, D. M. (1995). A transformational characterization of equivalent Bayesian network structures. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, page 87-98. Morgan Kaufmann Publishers Inc.
[5] Chickering, D. M. (2002). Optimal structure identification with greedy search. Journal of machine learning research, 3:507-554.
[6] Glasser, M. F., Coalson, T. S., Robinson, E. C., Hacker, C. D., Harwell, J., Yacoub, E., Ugurbil, K., Andersson, J., Beckmann, C. F., Jenkinson, M., et al. (2016). A multi-modal parcellation of human cerebral cortex. Nature, 536:171-178.
[7] Haughton, D. M. (1988). On the choice of a model to fit data from an exponential family. The annals of statistics, pages 342-355.
[8] Ikeuchi, T., Ide, M., Zeng, Y., Maeda, T. N., and Shimizu, S. (2023). Python package for causal discovery based on LiNGAM. Journal of Machine Learning Research, 24:1-8.
[9] Kass, R. E. and Vos, P. W. (2011). Geometrical foundations of asymptotic inference. John Wiley & Sons.
[10] Kummerfeld, E., Williams, L., and Ma, S. (2023). Power analysis for causal discovery. International Journal of Data Science and Analytics, pages 1-16.
[11] Lam, W.-y. (2023). Causal razors: A comparative study of simplicity assumptions in causal discovery. arXiv preprint arXiv:2302.10331.
[12] Lam, W.-Y., Andrews, B., and Ramsey, J. (2022). Greedy relaxations of the sparsest permutation algorithm. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 1052-1062. PMLR.
[13] Margaritis, D. and Thrun, S. (1999). Bayesian network induction via local neighborhoods. Advances in neural information processing systems, 12.
[14] Ng, I., Ghassami, A., and Zhang, K. (2020). On the role of sparsity and DAG constraints for learning linear DAGs. Advances in Neural Information Processing Systems, 33:17943-17954.
[15] Ramsey, J., Glynour, M., Sánchez-Romero, R., and Glynour, C. (2017). A million variables and more: the fast greedy equivalence search algorithm for learning high-dimensional graphical causal models, with an application to functional magnetic resonance images. International journal of data science and analytics, 3:121-129.
[16] Ramsey, J. D. (2021). Improving accuracy of permutation DAG search using best order score search. arXiv preprint arXiv:2108.10141.
[17] Ramsey, J. D., Zhang, K., Glymour, M., Romero, R. S., Huang, B., Ebert-Uphoff, I., Samarasinghe, S., Barnes, E. A., and Glymour, C. (2018). Tetrad—a toolbox for causal discovery. In 8th international workshop on climate informatics.
[18] Rawls, E., Kummerfeld, E., Mueller, B. A., Ma, S., and Zilverstand, A. (2022). The resting-state causal human connectome is characterized by hub connectivity of executive and attentional networks. NeuroImage, 255:119211.