Statistics at UC Berkeley: We are a community engaged in research and education in probability and statistics. In addition to developing fundamental theory and methodology, we are actively involved in statistical problems that arise in such diverse fields as molecular biology, geophysics, astronomy, AIDS research, neurophysiology, sociology, political science, education, demography, and the U.S. Census. We have forged strong interdisciplinary links with other departments and areas of study, particularly biostatistics, mathematics, computer science, and biology, and actively seek to recruit graduate students and faculty who can help to build and maintain such links. We also offer a statistical consulting service each semester.
Statistics at UC Berkeley
Bin Yu and Ben Brown's research featured in NSF news release about grant awards to support data science frontiers
Feb 8, 2018
Feb 8, 2018
Jan 24, 2018
Seminar 217, Risk Management: Solving the “curse of dimensionality” problem in multi-asset-class risk models
Speaker: Jose Menchero, Bloomberg (Speaker - Featured)
Estimating a robust risk model risk for a portfolio that spans multiple asset classes is a challenging task due to the “curse of dimensionality” (i.e., the problem of estimating too many relationships from too few observations). While the sample covariance matrix is easily computed, it is susceptible to capturing spurious relationships that make it unsuitable for portfolio construction purposes....
Feb 22, 2018 4:00pm ☞ HP Auditorium 306 Soda Hall
Abstract: Multicellular organisms develop by way of a lineage tree, a series of cell divisions that give rise to cell types, tissues, and organs. However, our knowledge of the cell lineage and its determinants remains extremely fragmentary for nearly all species. This includes all vertebrates and arthropods such as Drosophila, wherein cell lineage varies between individuals; embryos and organs.
Resolving whole organism cell fate with CRISPR/Cas9
David P. Williamson, Operations Research and Information Engineering, Cornell University
In this talk, I will look at a classical problem from graph theory of finding a large cut in a graph. We’ll start with a 1967 result of Erdős that showed that picking a random partition of the graph finds a cut that is at least half the largest possible cut. We’ll then describe a result due to Goemans and myself from 1995 that shows that by representing the graph as a set of vectors, one per...
Feb 26, 2018 4:00pm ☞ HP Auditorium 306 Soda Hall
Title: Abstract: I will present modeling and algorithmic designs for two challenging problems in biology and argue that efficient computational methods enable significant advances in our understanding of cell machinery and genome evolution. The first problem is the assembly of full-length transcripts -- the collection of expressed gene products in cells -- from noisy and highly...
Efficient algorithms for large-scale transcriptomics and genomics
Fraydoun Rezakhanlou, U C Berkeley
According to a classical result of Bertoin (1998), if the initial data for Burgers equation is a Levy Process with no positive jump, then the same is true at later times and there is an explicit equation for the evolution of the associated Levy measures. In 2010, Menon and Srinivasan published a conjecture for the statistical structure of solutions to scalar conservation laws with certain Markov...