Li, Chunlin; Shen, Xiaotong; Pan, Wei Likelihood ratio tests for a large directed acyclic graph. (English) Zbl 1441.62249 J. Am. Stat. Assoc. 115, No. 531, 1304-1319 (2020). Summary: Inference of directional pairwise relations between interacting units in a directed acyclic graph (DAG), such as a regulatory gene network, is common in practice, imposing challenges because of lack of inferential tools. For example, inferring a specific gene pathway of a regulatory gene network is biologically important. Yet, frequentist inference of directionality of connections remains largely unexplored for regulatory models. In this article, we propose constrained likelihood ratio tests for inference of the connectivity as well as directionality subject to nonconvex acyclicity constraints in a Gaussian directed graphical model. Particularly, we derive the asymptotic distributions of the constrained likelihood ratios in a high-dimensional situation. For testing of connectivity, the asymptotic distribution is either chi-squared or normal depending on if the number of testable links in a DAG model is small. For testing of directionality, the asymptotic distribution is the minimum of \(d\) independent chi-squared variables with one-degree of freedom or a generalized Gamma distribution depending on if \(d\) is small, where \(d\) is number of breakpoints in a hypothesized pathway. Moreover, we develop a computational method to perform the proposed tests, which integrates an alternating direction method of multipliers and difference convex programming. Finally, the power analysis and simulations suggest that the tests achieve the desired objectives of inference. An analysis of an Alzheimer’s disease gene expression dataset illustrates the utility of the proposed method to infer a directed pathway in a gene network. Cited in 3 Documents MSC: 62M30 Inference from spatial processes 62P10 Applications of statistics to biology and medical sciences; meta analysis Keywords:directed acyclic graph; gene network; high-dimensional inference; L0-regularization; nonconvex minimization Software:KEGG; MIM PDFBibTeX XMLCite \textit{C. Li} et al., J. Am. Stat. Assoc. 115, No. 531, 1304--1319 (2020; Zbl 1441.62249) Full Text: DOI Link References: [1] Boyd, S.; Parikh, N.; Chu, E.; Peleato, B.; Eckstein, J., “Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers,”, Foundations and Trends in Machine Learning, 3, 1-122 (2011) · Zbl 1229.90122 [2] Breiman, L.; Cutler, A., “A Deterministic Algorithm for Global Optimization,”, Mathematical Programming, 58, 179-199 (1993) · Zbl 0807.90103 [3] Bühlmann, P.; Peters, J.; Ernest, J., “CAM: Causal Additive Models, High-Dimensional Order Search and Penalized Regression,”, The Annals of Statistics, 42, 2526-2556 (2014) · Zbl 1309.62063 [4] Cheng, J.; Greiner, R.; Kelly, J.; Bell, D.; Liu, W., “Learning Bayesian Networks From Data: An Information-Theory Based Approach,”, Artificial intelligence, 137, 43-90 (2002) · Zbl 0995.68114 [5] Cormen, T. H.; Leiserson, C. E.; Rivest, R. L.; Stein, C., Introduction to Algorithms (2001), Cambridge, MA: The MIT Press, Cambridge, MA · Zbl 1047.68161 [6] Edwards, D., Introduction to Graphical Modelling (2012), New York: Springer Science & Business Media, New York [7] Foster, T. C.; Sharrow, K. M.; Masse, J. R.; Norris, C. M.; Kumar, A., “Calcineurin Links \(Ca####\) Dysregulation With Brain Aging,”, Journal of Neuroscience, 21, 4066-4073 (2001) [8] Fu, F.; Zhou, Q., “Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent,”, Journal of the American Statistical Association, 108, 288-300 (2013) · Zbl 06158343 [9] Gabay, D.; Mercier, B., A Dual Algorithm for the Solution of Nonlinear Variational Problems via Finite Element Approximation (1975), Rocquencourt: Institut de recherche d’informatique et d’automatique, Rocquencourt [10] Geyer, C. J., “On the Asymptotics of Constrained M-Estimation,”, The Annals of Statistics, 22, 1993-2010 (1994) · Zbl 0829.62029 [11] Gu, J.; Fu, F.; Zhou, Q., “Penalized Estimation of Directed Acyclic Graphs From Discrete Data,”, Statistics and Computing, 29, 161-176 (2017) · Zbl 1430.62018 [12] Horst, R.; Tuy, H., Global Optimization: Deterministic Approaches (2013), New York: Springer Science & Business Media, New York [13] Kanehisa, M.; Goto, S., “KEGG: Kyoto Encyclopedia of Genes and Genomes,”, Nucleic Acids Research, 28, 27-30 (2000) [14] Kolmogorov, A.; Tikhomirov, V., “ε-Entropy and ε-Capacity of Sets in Function Spaces,”, Uspekhi Matematicheskikh Nauk, 14, 3-86 (1959) · Zbl 0090.33503 [15] Laurent, B.; Massart, P., “Adaptive Estimation of a Quadratic Functional by Model Selection,”, Annals of Statistics, 28, 1302-1338 (2000) · Zbl 1105.62328 [16] Liu, J., Monte Carlo Strategies in Statistical Computing (2001), New York: Springer, New York [17] Liu, Z.; Zhang, M.; Xu, G.; Huo, C.; Tan, Q.; Li, Z.; Yuan, Q., “Effective Connectivity Analysis of the Brain Network in Drivers During Actual Driving Using Near-Infrared Spectroscopy,”, Frontiers in Behavioral Neuroscience, 11, 211 (2017) [18] Luo, R.; Zhao, H., “Bayesian Hierarchical Modeling for Signaling Pathway Inference From Single Cell Interventional Data,”, The Annals of Applied Statistics, 5, 725 (2011) · Zbl 1223.62014 [19] Núñez-Antón, V. A.; Zimmerman, D. L., Antedependence Models for Longitudinal Data (2009), Boca Raton, FL: Chapman and Hall/CRC, Boca Raton, FL [20] Ossiander, M., “A Central Limit Theorem Under Metric Entropy With L_2 Bracketing,”, The Annals of Probability, 15, 897-919 (1987) · Zbl 0665.60036 [21] Peters, J.; Bühlmann, P., “Identifiability of Gaussian Structural Equation Models With Equal Error Variances,”, Biometrika, 101, 219-228 (2014) · Zbl 1285.62005 [22] Peters, J.; Bühlmann, P.; Meinshausen, N., “Causal Inference by Using Invariant Prediction: Identification and Confidence Intervals,”, Journal of the Royal Statistical Society, Series B, 78, 947-1012 (2016) · Zbl 1414.62297 [23] Rockafellar, R.; Wets, R., Variational Analysis, 317 (2011), Berlin, Heidelberg: Springer, Berlin, Heidelberg · Zbl 0888.49001 [24] Rothenhäusler, D.; Bühlmann, P.; Meinshausen, N., “Causal Dantzig: Fast Inference in Linear Structural Equation Models With Hidden Variables Under Additive Interventions,”, The Annals of Statistics, 47, 1688-1722 (2019) · Zbl 1420.62309 [25] Sachs, K.; Perez, O.; Pe’er, D.; Lauffenburger, D. A.; Nolan, G. P., “Causal Protein-Signaling Networks Derived From Multiparameter Single-Cell Data,”, Science, 308, 523-529 (2005) [26] Shen, X.; Pan, W.; Zhu, Y., “Likelihood-Based Selection and Sharp Parameter Estimation,”, Journal of American Statistical Association, 107, 223-232 (2012) · Zbl 1261.62020 [27] Tao, P. D., “The DC (Difference of Convex Functions) Programming and DCA Revisited With DC Models of Real World Nonconvex Optimization Problems,”, Annals of Operations Research, 133, 23-46 (2005) · Zbl 1116.90122 [28] Vershynin, R., “How Close Is the Sample Covariance Matrix to the Actual Covariance Matrix?,”, Journal of Theoretical Probability, 25, 655-686 (2012) · Zbl 1365.62208 [29] Webster, J. A.; Gibbs, J. R.; Clarke, J.; Ray, M.; Zhang, W.; Holmans, P.; Rohrer, K.; Zhao, A.; Marlowe, L.; Kaleem, M.; McCorquodale, D. S. III, “Genetic Control of Human Brain Transcript Expression in Alzheimer Disease,”, The American Journal of Human Genetics, 84, 445-458 (2009) [30] Wong, W. H.; Shen, X., “Probability Inequalities for Likelihood Ratios and Convergence Rates of Sieve MLEs,”, The Annals of Statistics, 23, 339-362 (1995) · Zbl 0829.62002 [31] Yuan, Y.; Shen, X.; Pan, W.; Wang, Z., “Constrained Likelihood for Reconstructing a Directed Acyclic Gaussian Graph,”, Biometrika, 106, 109-125 (2019) · Zbl 1506.62298 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.