[20] E. Pavez, H. E. Egilmez, and A. Ortega, "Learning graphs with monotone topology properties and multiple connected components," IEEE Transactions on Signal Processing, vol. 66, no. 9, pp. 2399-2413, 2018.
[21] J. Ying, J. V. d. M. Cardoso, and D. P. Palomar, “A fast algorithm for graph learning under attractive Gaussian Markov random fields,” in 2021 55th Asilomar Conference on Signals, Systems, and Computers, 2021, pp. 1520–1524.
[22] Z. Deng and A. M.-C. So, “A fast proximal point algorithm for generalized graph Laplacian learning,” in ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2020, pp. 5425-5429.
[23] J. Ying, J. V. d. M. Cardoso, and D. P. Palomar, “Does the  $\ell_1$ -norm learn a sparse graph under Laplacian constrained graphical models?” arXiv preprint arXiv:2006.14925, 2020.
[24] ——, “Nonconvex sparse graph learning under Laplacian constrained graphical model,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 7101–7113.
[25] ——, “Minimax estimation of Laplacian constrained precision matrices,” in Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, vol. 130, 2021, pp. 3736–3744.
[26] H. E. Egilmez, E. Perez, and A. Ortega, "Graph learning from data under Laplacian and structural constraints," IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 825-841, 2017.
[27] J. Ying, X. Han, R. Zhou, X. Wang, and H. C. So, "Network topology inference with sparsity and Laplacian constraints," arXiv preprint arXiv:2309.00960, 2023.
[28] D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, "The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains," IEEE signal processing magazine, vol. 30, no. 3, pp. 83-98, 2013.
[29] F. Dorfler and F. Bullo, “Kron reduction of graphs with applications to electrical networks,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 60, no. 1, pp. 150–163, 2012.
[30] H. E. Egilmez, Y.-H. Chao, A. Ortega, B. Lee, and S. Yea, "GBST: Separable transforms based on line graphs for predictive video coding," in 2016 IEEE International Conference on Image Processing (ICIP). IEEE, 2016, pp. 2375-2379.
[31] J. V. D. M. Cardoso, J. Ying, and D. P. Palomar, "Graphical models in heavy-tailed markets," in Advances in Neural Information Processing Systems, vol. 34, 2021, pp. 1998-2001.
[32] ——, “Learning bipartite graphs: Heavy tails and multiple components,” in Advances in Neural Information Processing Systems, vol. 35, 2022, pp. 14044–14057.
[33] S. Kumar, J. Ying, J. V. d. M. Cardoso, and D. P. Palomar, "A unified framework for structured graph learning via spectral constraints," Journal of Machine Learning Research, vol. 21, no. 22, pp. 1-60, 2020.
[34] ——, “Structured graph learning via Laplacian spectral constraints,” in Advances in Neural Information Processing Systems, vol. 32, 2019, pp. 11647-11658.
[35] E. Pavez and A. Ortega, "Generalized Laplacian precision matrix estimation for graph signal processing," in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016, pp. 6350-6354.
[36] J. Ying, J. V. D. M. Cardoso, and D. P. Palomar, "Adaptive estimation of graphical models under total positivity," in International Conference on Machine Learning, 2023, pp. 40054-40074.
[37] J.-F. Cai, J. V. d. M. Cardoso, D. P. Palomar, and J. Ying, "Fast projected Newton-like method for precision matrix estimation under total positivity," arXiv preprint arXiv:2112.01939, 2021.
[38] S. Sojoudi, "Equivalence of graphical lasso and thresholding for sparse graphs," The Journal of Machine Learning Research, vol. 17, no. 1, pp. 3943-3963, 2016.
[39] S. Fattahi and S. Sojoudi, "Graphical lasso and thresholding: Equivalence and closed-form solutions," Journal of Machine Learning Research, 2019.
[40] J. M. Schmidt, “A simple test on 2-vertex-and 2-edge-connectivity,” Information Processing Letters, vol. 113, no. 7, pp. 241–244, 2013.