IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v34y2019i2d10.1007_s00180-018-0841-8.html
   My bibliography  Save this article

Structure learning of sparse directed acyclic graphs incorporating the scale-free property

Author

Listed:
  • Xiao Guo

    (Northwest University)

  • Hai Zhang

    (Northwest University
    Macau University of Science and Technology)

  • Yao Wang

    (Xi’an Jiaotong University)

  • Yong Liang

    (Macau University of Science and Technology)

Abstract

Directed acyclic graphs have been widely used to model the causal relationships among variables. Many existing works focus on $$l_1$$ l 1 based methods to induce sparsity. However, in addition to sparsity, studies on networks show that many real networks are scale-free, that is, the degree of the network follows a power-law. To capture the scale-free property, in this paper we propose a novel penalized likelihood method by employing a log 1-norm group penalty which is the composite of the well-known log-type and lasso-type penalty functions. We then design an efficient coordinate descent algorithm to solve the resulting nonconvex problem. Moreover, we establish the estimation consistency of the estimator under the setting where the error variances are fixed at an identical constant. Numerical studies are also conducted to demonstrate the merits of our method.

Suggested Citation

  • Xiao Guo & Hai Zhang & Yao Wang & Yong Liang, 2019. "Structure learning of sparse directed acyclic graphs incorporating the scale-free property," Computational Statistics, Springer, vol. 34(2), pages 713-742, June.
    • Handle: RePEc:spr:compst:v:34:y:2019:i:2:d:10.1007_s00180-018-0841-8
    DOI: 10.1007/s00180-018-0841-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-018-0841-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-018-0841-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ali Shojaie & Alexandra Jauhiainen & Michael Kallitsis & George Michailidis, 2014. "Inferring Regulatory Networks by Combining Perturbation Screens and Steady State Gene Expression Profiles," PLOS ONE, Public Library of Science, vol. 9(2), pages 1-16, February.
    2. Peng, Jie & Wang, Pei & Zhou, Nengfeng & Zhu, Ji, 2009. "Partial Correlation Estimation by Joint Sparse Regression Models," Journal of the American Statistical Association, American Statistical Association, vol. 104(486), pages 735-746.
    3. Ming Yuan & Yi Lin, 2007. "Model selection and estimation in the Gaussian graphical model," Biometrika, Biometrika Trust, vol. 94(1), pages 19-35.
    4. Fei Fu & Qing Zhou, 2013. "Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 108(501), pages 288-300, March.
    5. Ali Shojaie & George Michailidis, 2010. "Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs," Biometrika, Biometrika Trust, vol. 97(3), pages 519-538.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiao Guo & Hai Zhang, 2020. "Sparse directed acyclic graphs incorporating the covariates," Statistical Papers, Springer, vol. 61(5), pages 2119-2148, October.
    2. Seunghwan Lee & Sang Cheol Kim & Donghyeon Yu, 2023. "An efficient GPU-parallel coordinate descent algorithm for sparse precision matrix estimation via scaled lasso," Computational Statistics, Springer, vol. 38(1), pages 217-242, March.
    3. Kim, Kyongwon, 2022. "On principal graphical models with application to gene network," Computational Statistics & Data Analysis, Elsevier, vol. 166(C).
    4. Bar, Haim & Wells, Martin T., 2023. "On graphical models and convex geometry," Computational Statistics & Data Analysis, Elsevier, vol. 187(C).
    5. Claudia Angelini & Daniela De Canditiis & Anna Plaksienko, 2021. "Jewel : A Novel Method for Joint Estimation of Gaussian Graphical Models," Mathematics, MDPI, vol. 9(17), pages 1-24, August.
    6. Lafit, Ginette & Nogales Martín, Francisco Javier & Zamar, Rubén, 2015. "Ranking Edges and Model Selection in High-Dimensional Graphs," DES - Working Papers. Statistics and Econometrics. WS ws1511, Universidad Carlos III de Madrid. Departamento de Estadística.
    7. Guanghui Cheng & Zhengjun Zhang & Baoxue Zhang, 2017. "Test for bandedness of high-dimensional precision matrices," Journal of Nonparametric Statistics, Taylor & Francis Journals, vol. 29(4), pages 884-902, October.
    8. Bailey, Natalia & Pesaran, M. Hashem & Smith, L. Vanessa, 2019. "A multiple testing approach to the regularisation of large sample correlation matrices," Journal of Econometrics, Elsevier, vol. 208(2), pages 507-534.
    9. Kuang‐Yao Lee & Lexin Li, 2022. "Functional structural equation model," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 600-629, April.
    10. Huihang Liu & Xinyu Zhang, 2023. "Frequentist model averaging for undirected Gaussian graphical models," Biometrics, The International Biometric Society, vol. 79(3), pages 2050-2062, September.
    11. Zheng, Zemin & Shi, Haiyu & Li, Yang & Yuan, Hui, 2020. "Uniform joint screening for ultra-high dimensional graphical models," Journal of Multivariate Analysis, Elsevier, vol. 179(C).
    12. Yang Ni & Francesco C. Stingo & Veerabhadran Baladandayuthapani, 2015. "Bayesian nonlinear model selection for gene regulatory networks," Biometrics, The International Biometric Society, vol. 71(3), pages 585-595, September.
    13. Tan, Kean Ming & Witten, Daniela & Shojaie, Ali, 2015. "The cluster graphical lasso for improved estimation of Gaussian graphical models," Computational Statistics & Data Analysis, Elsevier, vol. 85(C), pages 23-36.
    14. Chang, Jinyuan & Qiu, Yumou & Yao, Qiwei & Zou, Tao, 2018. "Confidence regions for entries of a large precision matrix," LSE Research Online Documents on Economics 87513, London School of Economics and Political Science, LSE Library.
    15. Yan Zhou & Peter X.‐K. Song & Xiaoquan Wen, 2021. "Structural factor equation models for causal network construction via directed acyclic mixed graphs," Biometrics, The International Biometric Society, vol. 77(2), pages 573-586, June.
    16. Hirose, Kei & Fujisawa, Hironori & Sese, Jun, 2017. "Robust sparse Gaussian graphical modeling," Journal of Multivariate Analysis, Elsevier, vol. 161(C), pages 172-190.
    17. Fan, Xinyan & Zhang, Qingzhao & Ma, Shuangge & Fang, Kuangnan, 2021. "Conditional score matching for high-dimensional partial graphical models," Computational Statistics & Data Analysis, Elsevier, vol. 153(C).
    18. Lee, Wonyul & Liu, Yufeng, 2012. "Simultaneous multiple response regression and inverse covariance matrix estimation via penalized Gaussian maximum likelihood," Journal of Multivariate Analysis, Elsevier, vol. 111(C), pages 241-255.
    19. Ines Wilms & Jacob Bien, 2021. "Tree-based Node Aggregation in Sparse Graphical Models," Papers 2101.12503, arXiv.org.
    20. Young-Geun Choi & Seunghwan Lee & Donghyeon Yu, 2022. "An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units," Computational Statistics, Springer, vol. 37(1), pages 419-443, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:34:y:2019:i:2:d:10.1007_s00180-018-0841-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.