SearcharxivSearch

arXiv subjects

Xiaochen Long

Publications and source records attributed to Xiaochen Long.

2 recordsLinked to original sources

An Approximate Maximum Likelihood Estimator for Discretely Observed Linear Birth-and-Death Processes

Linear birth-and-death processes (LBDPs) are foundational stochastic models in population dynamics, evolutionary biology, and hematopoiesis. Estimating parameters from discretely observed data is computationally demanding due to irregular sampling, noise, and missing values. We propose a novel approximate maximum likelihood estimator (MLE) for LBDPs based on a Gaussian approximation to transition probabilities. The approach transforms estimation into a univariate optimization problem, achieving substantial computational gains without sacrificing accuracy. Through simulations, we show that the approximate MLE outperforms Gaussian and saddlepoint-based estimators in speed and precision under realistic noise and sparsity. Applied to longitudinal clonal hematopoiesis data, the method produces biologically meaningful growth estimates even with noisy, compositional input. Unlike Gaussian and saddlepoint approximations, our estimator is invariant to data scaling, making it ideal for real-world applications such as variant allele frequency analyses.

stat.CO

Large-scale estimation of random graph models with local dependence

A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open problem is how to estimate such models from large networks. A novel approach to large-scale estimation is proposed, taking advantage of the local structure of such models for the purpose of local computing. The main idea is that random graphs with local dependence can be decomposed into subgraphs, which enables parallel computing on subgraphs and suggests a two-step estimation approach. The first step estimates the local structure underlying random graphs. The second step estimates parameters given the estimated local structure of random graphs. Both steps can be implemented in parallel, which enables large-scale estimation. The advantages of the two-step estimation approach are demonstrated by simulation studies with up to 10,000 nodes and an application to a large Amazon product recommendation network with more than 10,000 products.

stat.CO