In genomics, we often observe a sequence of graphs over some notion of time, such as the gene network ordered by the cells' developmental age. However, there is a lack of concrete statistical theory for this setting whose assumptions are amendable for single-cell analyses. In this work, we develop an estimator designed for models where the underlying stochastic block model is smoothly changing with time, and prove the convergence rates of the clustering and estimates of the connectivity matrix under assumptions more general than those existing in the literature. We apply this to study the dynamics of gene co-expression networks among oligodendrocytes.

As single-cell RNA-seq (scRNA) transitions from studying cell-lines, clonal mice or a few individuals into studying cohorts of individuals, there is a need to create new differential expression (DE) methods to investigate DE among individuals instead of among cells. Towards this end, we tailor the eSVD, formerly a dimension-reduction tool, equipped with a downstream pipeline to perform DE in multi-individual scRNA data, where we both design our test statistics to account for variability among and within individuals as well as incorporating the individual-level covariates into the eSVD-DE framework. We show that this can recover reproducible signals across different datasets as well as achieves higher power thanks to its dimension-reduction framework.

Different sequencing technologies offer complementary insights into a biological system, but it becomes difficult to integrate two datasets together when both datasets differ in the specific cells sequenced as well as which features are measured. Hence, using an iterative co-embedding based on CCA, data smoothing, and cell matching, we match cells in one dataset (i.e., one modality) to the other. The effectiveness of our method is demonstrated by integrating scRNA-seq and surface-antibody data, as well as scRNA-seq data with spatial proteomic data (such as CODEX) and scATAC-seq.

Paired multiomic single-cell data provides ample opportunities for biologists to study the relations between molecular modalities (such as gene expression and chromatin peaks), but it difficult to assess what kind of signals are shared in common between the two modalities. We developed the Tilted-CCA, which shows the "intersection of information" between the two modalities, in contrast with many existing dimension-reduction methods that show the "union of information." In particular, the matrix decomposition provided by Tilted-CCA allows us to design targeted antibody panels for RNA and surface-antibody technologies, as well as uncover the terminal cell-states as well as the relation between chromatin open/closed cell-states and gene expression in developmental systems.

There are different signals a researcher can extract from single-cell ATAC-seq, and each has their own biological relevance for downstream analysis. However, one might want to perform computational tasks that aggregate all such signals together. We propose a computational framework to aggregate across such signals for downstream visualization, cell-clustering and trajectory inference.

While clustering of nodes is now theoretically well-understood for a single network through the lense of spectral embeddings, the theoretical understanding for clustering in multi-layer networks is less well-understood. In this paper, when the clustering structure is shared across all the layers, we develop a simple way to aggregate information across layers via squaring the adjacency matrix with an appropriate bias-adjustment. Our theoretical analysis shows we can both allow for networks with dissociative structure (i.e., negative eigenvalues) and provably obtains consistent clustering even if each individual network is extremely sparse. We apply our method to study cluster of genes in developing monkey brains.

Methods to detect multiple changepoints in regression coefficients typically have localization rate (i.e., rate to estimate the location of the changepoints) that scale inversely with the square root with number of samples. In this paper, we develop VPWBS, a method that appropriately transforms the regression problem into a one-dimensional problem upon which we apply WBS. We prove the convergence rate scales inversely with number of samples, a substantial improvement over existing rates.

Common pipelines to estimate the cell developmental trajectories based on single-cell data typically first embed each cell into a lower-dimensional space, but these embedding typically assume statistical models that do not model single-cell data well. In this paper, we develop an embedding for hierarchical model where the inner product between two latent low-dimensional vectors is the natural parameter of an exponential family distributed random variable, and prove identifiability and convergence. When studying oligodendrocytes in fetal mouse brains, we find that oligodendrocytes mature into various cell types.

Changepoint detection methods such as binary segmentation are often used in CGH analyses for copy number variation detection, but these methods lack proper downstream statistical inference. In this paper, we develop post-selection hypothesis tests for various changepoint detection methods, prove our sampling strategies' validity, and provide substantial practical guidelines based on simulation.

Microarray samples from brain tissue is hard to collect, and also varies substantially depending on the tissue's brain region and the developmental age of its subject, hence it is hard to collect enough samples for the statistical analysis. In this paper, we develop a sample selection method to find additional microarray samples that are statistically similar to the samples of our desired spatio-temporal brain tissue. We demonstrate that after apply an existing analysis pipeline to our selected samples, we detect a higher percentage of autism risk genes.

We discuss "Network cross-validation by edge sampling" by Li, Levina, and Zhu (Biometrika, 2020) where empirically explore the possibilities of combining the ideas of the authors with ideas providing confidence sets for cross-validated parameters as well as extending the ideas of the authors into the network tensor setting.

While de novo mutations within the protein-coding portion of the genome have been thoroughly studied, these mutations in the noncoding portions which comprise of 98.5% of the genome have been less well understood. In this paper, we use a bioinformatics framework that builds upon (among other things) sparse PCA and DAWN based on simulated null datasets to analyze 1902 autism quartets via WGS and find that the strongest signals arose from promoters -- noncoding regions that control gene transcription.

Changepoint estimators have statistical theory for how well they estimate the mean function and how well they estimate the changepoints, but existing theory often analyzes these properties separately. In this paper, we prove a near-optimal estimation rate for the fused lasso, which in turn directly proves a changepoint detection rate that is near the detection limit. We extend this logic to other estimators and settings.

Social biases can influence Wikipedia articles of individuals across different genders and ethnicities that result in disproportiate article lengths, number of languages written about said individuals, etc., but these differences can be difficult to quantify appropriately. In this paper, we develop a matching method to find an appropriate comparison set of articles for each target group of interest (ex: articles of African American individuals) based on the articles' categories. We show the differing covariate distributions across the different target groups, and uncover quantitative results that reinforce existing social theories. This paper won the Wikimedia Foundation Research Award of the Year in 2023.

Dependency graphs encode complex pairwise patterns that are often statistically estimated, but are often hard to diagnose with visualizations due to the quadratic number of scatter plots. In this paper, we develop an interactive system in R that learns if the data scientist visually interprets dependency. Then, this system applies the learned classifier to infer a dependency graph that can be compared against the estimated graph. This paper won honorable mention for the Student Paper Award in the ASA Section: Statistical Computing and Statistical Graphics (2018).

Many compressed sensing are developed to be as generic as possible, but have shortcomings in specialized settings where modern optimization theory can deliver a substantial boost in computational efficiency. In this paper, we develop two compressed sensing algorithms, one specialized for extremely sparse signals and another specialized for Kronecker-structed sensing matrices. We numerically demonstrate a near 10-times reduction in computation time compared to other state-of-the-art methods.