Person:
Pillai, Natesh

Loading...
Profile Picture

Email Address

AA Acceptance Date

Birth Date

Research Projects

Organizational Units

Job Title

Last Name

Pillai

First Name

Natesh

Name

Pillai, Natesh

Search Results

Now showing 1 - 10 of 12
  • Publication
    Combined Influence of Soil Moisture and Atmospheric Evaporative Demand Is Important for Accurately Predicting US Maize Yields
    (Springer Science and Business Media LLC, 2020-02-18) Rigden, A. J.; Mueller, N. D.; Holbrook, N. M.; Pillai, Natesh; Huybers, Peter
    Understanding the response of agriculture to heat and moisture stress is essential to adapt food systems under climate change. Although evidence of crop yield loss with extreme temperature is abundant, disentangling the roles of temperature and moisture in determining yield has proven challenging, largely due to the limited soil moisture data and the tight coupling between moisture and temperature at the land surface. Here, using well-resolved observations of soil moisture from the recently launched Soil Moisture Active Passive satellite, we quantified the contribution of imbalances between atmospheric evaporative demand and soil moisture to maize yield damages in the U.S. Midwest. We show that retrospective yield predictions based on the interactions between atmospheric demand and soil moisture significantly outperform those using temperature and precipitation singly or together. The importance of accounting for this water balance is highlighted by the fact that climate simulations uniformly predict increases in atmospheric demand during the growing season but root-zone soils that are variously drier or wetter. A damage estimate conditioned only on simulated changes in atmospheric demand, as opposed to also accounting for changes in soil-moisture, would erroneously indicate approximately twice the damage. This research demonstrates that more accurate predictions of maize yield can be achieved by using soil moisture data and indicates that accurate estimates of how climate change will influence crop yields requires explicitly accounting for variations in water availability.
  • Thumbnail Image
    Publication
    Kac’s walk on n-sphere mixes in n log n steps
    (2017) Pillai, Natesh; Smith, Aaron
    Determining the mixing time of Kac's random walk on the sphere Sn−1 is a long-standing open problem. We show that the total variation mixing time of Kac's walk on Sn−1 is between 12nlog(n) and 200nlog(n). Our bound is thus optimal up to a constant factor, improving on the best-known upper bound of O(n5log(n)2) due to Jiang. Our main tool is a `non-Markovian' coupling recently introduced by the second author for obtaining the convergence rates of certain high dimensional Gibbs samplers in continuous state spaces.
  • Thumbnail Image
    Publication
    Model Comparison and Assessment for Single Particle Tracking in Biological Fluids
    (Informa UK Limited, 2016) Lysy, Martin; Pillai, Natesh; Hill, David; Forest, M. Gregory; Mellnik, John W. R.; Vasquez, Paula A.; McKinley, Scott A.
    State-of-the-art techniques in passive particle-tracking microscopy provide high-resolution path trajectories of diverse foreign particles in biological fluids. For particles on the order of 1 μm diameter, these paths are generally inconsistent with simple Brownian motion. Yet, despite an abundance of data confirming these findings and their wide-ranging scientific implications, stochastic modeling of the complex particle motion has received comparatively little attention. Even among posited models, there is virtually no literature on likelihood-based inference, model comparisons, and other quantitative assessments. In this article, we develop a rigorous and computationally efficient Bayesian methodology to address this gap. We analyze two of the most prevalent candidate models for 30-sec paths of 1 μm diameter tracer particles in human lung mucus: fractional Brownian motion (fBM) and a Generalized Langevin Equation (GLE) consistent with viscoelastic theory. Our model comparisons distinctly favor GLE over fBM, with the former describing the data remarkably well up to the timescales for which we have reliable information. Supplementary materials for this article are available online.
  • Thumbnail Image
    Publication
    Lack of Confidence in Approximate Bayesian Computation Model Choice
    (Proceedings of the National Academy of Sciences, 2011) Robert, Christian P.; Cornuet, Jean-Marie; Marin, Jean-Michel; Pillai, Natesh
    Approximate Bayesian computation (ABC) have become an essential tool for the analysis of complex stochastic models. Grelaud et al. [(2009) Bayesian Anal 3:427–442] advocated the use of ABC for model choice in the specific case of Gibbs random fields, relying on an intermodel sufficiency property to show that the approximation was legitimate. We implemented ABC model choice in a wide range of phylogenetic models in the Do It Yourself-ABC (DIY-ABC) software [Cornuet et al. (2008) Bioinformatics 24:2713–2719]. We now present arguments as to why the theoretical arguments for ABC model choice are missing, because the algorithm involves an unknown loss of information induced by the use of insufficient summary statistics. The approximation error of the posterior probabilities of the models under comparison may thus be unrelated with the computational effort spent in running an ABC algorithm. We then conclude that additional empirical verifications of the performances of the ABC procedure as those available in DIY-ABC are necessary to conduct model choice.
  • Publication
    Elementary bounds on mixing times for decomposable Markov chains
    (Elsevier BV, 2017-09) Pillai, Natesh; Smith, Aaron
    Many finite-state reversible Markov chains can be naturally decomposed into “projection” and “restriction” chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties of these related chains. This paper is in the tradition of existing bounds on Poincar ́e and log-Sobolev constants of Markov chains in terms of similar decompositions [JSTV04, MR02, MR06, MY09]. Our proofs are simple, relying largely on recent results relating hitting and mixing times of reversible Markov chains [PS13, Oli12]. We describe situations in which our results give substantially better bounds than those obtained by applying existing decomposition results and provide examples for illustration.
  • Publication
    Single Particle, Passive Microrheology in Biological Fluids with Drift
    Pillai, Natesh
    Volume limitations and low yield thresholds of biological fluids have led to widespread use of passive microparticle rheology. The mean-squared-displacement (MSD) statistics of bead position time series (bead paths) are transformed to determine dynamic storage and loss moduli [Mason and Weitz (1995)]. A prevalent hurdle arises when there is a non-diffusive experimental drift in the data. Commensurate with the magnitude of drift relative to diffusive mobility, quantified by a Péclet number, the MSD statistics are distorted, and thus the path data must be “corrected” for drift. The standard approach is to estimate and subtract the drift from particle paths, and then calculate MSD statistics. We present an alternative, parametric approach using maximum likelihood estimation (MLE) that simultaneously fits drift and diffusive model parameters from the path data; the MSD statistics (and dynamic moduli) then follow directly from the best-fit model. We illustrate and compare both methods on simulated path data over a range of Péclet numbers, where exact answers are known. We choose fractional Brownian motion as the numerical model because it affords tunable, sub-diffusive MSD statistics consistent with several biological fluids. Finally, we apply and compare both methods on data from human bronchial epithelial cell culture mucus.
  • Publication
    Mixing times for a constrained Ising process on the torus at low density
    (Institute of Mathematical Statistics, 2017-03) Pillai, Natesh; Smith, Aaron
    We study a kinetically constrained Ising process (KCIP) associated with a graph G and density parameter p; this process is an interacting particle system with state space {0, 1}G. The stationary distribution of the KCIP Markov chain is the Binomial(|G|,p) distribution on the number of particles, conditioned on having at least one particle. The ‘constraint’ in the name of the process refers to the rule that a vertex cannot change its state unless it has at least one neighbour in state ‘1’. The KCIP has been proposed by statistical physicists as a model for the glass transition, and more recently as a simple algorithm for data storage in computer networks. In this note, we study the mixing time of this process onthetorusG=Zd,d≥3,inthelow-densityregimep= c forarbitrary0
  • Publication
    Statistical inference for dynamical systems: A review
    (Institute of Mathematical Statistics, 2015-01-01) McGoff, Kevin; Mukherjee, Sayan; Pillai, Natesh
    The topic of statistical inference for dynamical systems has been studied extensively across several fields. In this survey we focus on the problem of parameter estimation for nonlinear dynamical systems. Our objective is to place results across distinct disciplines in a common setting and highlight opportunities for further research.
  • Publication
    Bayesian Nonparametric Weighted Sampling Inference
    (Institute of Mathematical Statistics, 2015-09) Si, Yajuan; Pillai, Natesh; Gelman, Andrew
    It has historically been a challenge to perform Bayesian inference in a design-based survey context. The present paper develops a Bayesian model for sampling inference in the presence of inverse-probability weights. We use a hierar- chical approach in which we model the distribution of the weights of the nonsam- pled units in the population and simultaneously include them as predictors in a nonparametric Gaussian process regression. We use simulation studies to evaluate the performance of our procedure and compare it to the classical design-based es- timator. We apply our method to the Fragile Family and Child Wellbeing Study. Our studies find the Bayesian nonparametric finite population estimator to be more robust than the classical design-based estimator without loss in efficiency, which works because we induce regularization for small cells and thus this is a way of automatically smoothing the highly variable weights.
  • Thumbnail Image
    Publication
    An unexpected encounter with Cauchy and Lévy
    (Institute of Mathematical Statistics, 2016) Pillai, Natesh; Meng, Xiao-li