Functional directed acyclic graphs
- 2023-08-14 (Mon.), 10:30 AM
- Auditorium, B1F, Institute of Statistical Science；The tea reception will be held at 10:10.
- Online live streaming through Cisco Webex will be available.
- Professor Kuang-Yao Lee
- Department of Statistics, Operations, and Data Science (SODS), Temple University
Abstract
In this work, we introduce a new method to estimate a directed acyclic graph (DAG) from multivariate functional data. We build on the notion of faithfulness that relates a DAG with a set of conditional independences among the random functions. We develop two linear operators, the conditional covariance operator and the partial correlation operator, to characterize and evaluate the conditional independence. Based on these operators, we adapt and extend the PC-algorithm to estimate the functional directed graph, so that the computation time depends on the sparsity rather than the full size of the graph. We study the asymptotic properties of the two operators, derive their uniform convergence rates, and establish the uniform consistency of the estimated graph, all of which are obtained while allowing the graph size to diverge to infinity with the sample size. We demonstrate the efficacy of our method through both simulations and an application to a time-course proteomic dataset. (This is joint work with Lexin Li (UC Berkeley) and Bing Li (Penn State))
Please click here for participating the talk online.
Please click here for participating the talk online.
Download
Update：2023-08-07 16:34
Back
