Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 18 of 18

Full-Text Articles in Mathematics

What's In A Name? A Critical Review Of Definitions Of Quantitative Literacy, Numeracy, And Quantitative Reasoning, Gizem Karaali, Edwin H Villafane Hernandez '18, Jeremy Alexander Taylor '18 Jan 2016

What's In A Name? A Critical Review Of Definitions Of Quantitative Literacy, Numeracy, And Quantitative Reasoning, Gizem Karaali, Edwin H Villafane Hernandez '18, Jeremy Alexander Taylor '18

Pomona Faculty Publications and Research

This article aims to bring together various threads in the eclectic literature that make up the scholarship around the theme of Quantitative Literacy. In investigating the meanings of terms like "quantitative literacy," "quantitative reasoning," and "numeracy," we seek common ground, common themes, common goals and aspirations of a community of practitioners. A decade ago, these terms were relatively new in the public sphere; today policy makers and accrediting agencies are routinely inserting them into general education conversations. Having good, representative, and perhaps even compact and easily digestible definitions of these terms might come in handy in public relations contexts as …


A Method For Generating Realistic Correlation Matrices, Johanna S. Hardin, Stephan Ramon Garcia, David Golan Jan 2013

A Method For Generating Realistic Correlation Matrices, Johanna S. Hardin, Stephan Ramon Garcia, David Golan

Pomona Faculty Publications and Research

Simulating sample correlation matrices is important in many areas of statistics. Approaches such as generating Gaussian data and finding their sample correlation matrix or generating random uniform $[-1,1]$ deviates as pairwise correlations both have drawbacks. We develop an algorithm for adding noise, in a highly controlled manner, to general correlation matrices. In many instances, our method yields results which are superior to those obtained by simply simulating Gaussian data. Moreover, we demonstrate how our general algorithm can be tailored to a number of different correlation models. Using our results with a few different applications, we show that simulating correlation matrices …


Medicine, Statistics, And Education: The Inextricable Link, Katharine K. Brieger '11, Johanna S. Hardin Jan 2012

Medicine, Statistics, And Education: The Inextricable Link, Katharine K. Brieger '11, Johanna S. Hardin

Pomona Faculty Publications and Research

No abstract provided.


Changes Across 25 Years Of Statistics In Medicine, Johanna S. Hardin Jan 2012

Changes Across 25 Years Of Statistics In Medicine, Johanna S. Hardin

Pomona Faculty Publications and Research

[This piece is a series of interviews with giants in the field of medicine on their views of how statistics is changing medicine. I interviewed the editor of the New England Journal of Medicine, a preeminent doctor/researcher of lung cancer, the director of the LA County Department of Public Health, and a Harvard statistician who sits on the editorial board of the New England Journal of Medicine.]


A Robust Measure Of Correlation Between Two Genes On A Microarray, Johanna S. Hardin, Aya Mitani '06, Leanne Hicks, Brian Vankoten Jan 2007

A Robust Measure Of Correlation Between Two Genes On A Microarray, Johanna S. Hardin, Aya Mitani '06, Leanne Hicks, Brian Vankoten

Pomona Faculty Publications and Research

Background

The underlying goal of microarray experiments is to identify gene expression patterns across different experimental conditions. Genes that are contained in a particular pathway or that respond similarly to experimental conditions could be co-expressed and show similar patterns of expression on a microarray. Using any of a variety of clustering methods or gene network analyses we can partition genes of interest into groups, clusters, or modules based on measures of similarity. Typically, Pearson correlation is used to measure distance (or similarity) before implementing a clustering algorithm. Pearson correlation is quite susceptible to outliers, however, an unfortunate characteristic when dealing …


Analyzing Dna Microarrays With Undergraduate Statisticians, Johanna S. Hardin, Laura Hoopes, Ryan Murphy '06 Jan 2006

Analyzing Dna Microarrays With Undergraduate Statisticians, Johanna S. Hardin, Laura Hoopes, Ryan Murphy '06

Pomona Faculty Publications and Research

With advances in technology, biologists have been saddled with high dimensional data that need modern statistical methodology for analysis. DNA microarrays are able to simultaneously measure thousands of genes (and the activity of those genes) in a single sample. Biologists use microarrays to trace connections between pathways or to identify all genes that respond to a signal. The statistical tools we usually teach our undergraduates are inadequate for analyzing thousands of measurements on tens of samples. The project materials include readings on microarrays as well as computer lab activities. The topics covered include image analysis, filtering and normalization techniques, and …


Yeast Through The Ages: A Statistical Analysis Of Genetic Changes In Aging Yeast, Alison Wise '05, Johanna S. Hardin, Laura Hoopes Jan 2006

Yeast Through The Ages: A Statistical Analysis Of Genetic Changes In Aging Yeast, Alison Wise '05, Johanna S. Hardin, Laura Hoopes

Pomona Faculty Publications and Research

Microarray technology allows for the expression levels of thousands of genes in a cell to be measured simultaneously. The technology provides great potential in the fields of biology and medicine, as the analysis of data obtained from microarray experiments gives insight into the roles of specific genes and the associated changes across experimental conditions (e.g., aging, mutation, radiation therapy, drug dosage). The application of statistical tools to microarray data can help make sense of the experiment and thereby advance genetic, biological, and medical research. Likewise, microarrays provide an exciting means through which to explore statistical techniques.


Microarray Data From A Statistician’S Point Of View, Johanna S. Hardin Jan 2005

Microarray Data From A Statistician’S Point Of View, Johanna S. Hardin

Pomona Faculty Publications and Research

No abstract provided.


Random Walks On The Torus With Several Generators, Timothy Prescott '02, Francis E. Su Oct 2004

Random Walks On The Torus With Several Generators, Timothy Prescott '02, Francis E. Su

All HMC Faculty Publications and Research

Given n vectors {i} ∈ [0, 1)d, consider a random walk on the d-dimensional torus d = ℝd/ℤd generated by these vectors by successive addition and subtraction. For certain sets of vectors, this walk converges to Haar (uniform) measure on the torus. We show that the discrepancy distance D(Q*k) between the kth step distribution of the walk and Haar measure is bounded below by D(Q*k) ≥ C1k−n/2, where C1 = C(n, d) is …


Evaluation Of Multiple Models To Distinguish Closely Related Forms Of Disease Using Dna Microarray Data: An Application To Multiple Myeloma, Johanna S. Hardin, Michael Waddell, C. David Page, Fenghuang Zhan, Bart Barlogie, John Shaughnessy, John J. Crowley Jan 2004

Evaluation Of Multiple Models To Distinguish Closely Related Forms Of Disease Using Dna Microarray Data: An Application To Multiple Myeloma, Johanna S. Hardin, Michael Waddell, C. David Page, Fenghuang Zhan, Bart Barlogie, John Shaughnessy, John J. Crowley

Pomona Faculty Publications and Research

Motivation: Standard laboratory classification of the plasma cell dyscrasia monoclonal gammopathy of undetermined significance (MGUS) and the overt plasma cell neoplasm multiple myeloma (MM) is quite accurate, yet, for the most part, biologically uninformative. Most, if not all, cancers are caused by inherited or acquired genetic mutations that manifest themselves in altered gene expression patterns in the clonally related cancer cells. Microarray technology allows for qualitative and quantitative measurements of the expression levels of thousands of genes simultaneously, and it has now been used both to classify cancers that are morphologically indistinguishable and to predict response to therapy. It is …


On Choosing And Bounding Probability Metrics, Alison L. Gibbs, Francis E. Su Dec 2002

On Choosing And Bounding Probability Metrics, Alison L. Gibbs, Francis E. Su

All HMC Faculty Publications and Research

When studying convergence of measures, an important issue is the choice of probability metric. We provide a summary and some new results concerning bounds among some important probability metrics/distances that are used by statisticians and probabilists. Knowledge of other metrics can provide a means of deriving bounds for another one in an applied problem. Considering other metrics can also provide alternate insights. We also give examples that show that rates of convergence can strongly depend on the metric chosen. Careful consideration is necessary when choosing a metric.


Discrepancy Convergence For The Drunkard's Walk On The Sphere, Francis E. Su Feb 2001

Discrepancy Convergence For The Drunkard's Walk On The Sphere, Francis E. Su

All HMC Faculty Publications and Research

We analyze the drunkard's walk on the unit sphere with step size θ and show that the walk converges in order C/sin2(θ) steps in the discrepancy metric (C a constant). This is an application of techniques we develop for bounding the discrepancy of random walks on Gelfand pairs generated by bi-invariant measures. In such cases, Fourier analysis on the acting group admits tractable computations involving spherical functions. We advocate the use of discrepancy as a metric on probabilities for state spaces with isometric group actions.


A Rational Solution To Cootie, Arthur T. Benjamin, Matthew T. Fluet '99 Mar 2000

A Rational Solution To Cootie, Arthur T. Benjamin, Matthew T. Fluet '99

All HMC Faculty Publications and Research

No abstract provided in this article.


A Leveque-Type Lower Bound For Discrepancy, Francis E. Su Jan 2000

A Leveque-Type Lower Bound For Discrepancy, Francis E. Su

All HMC Faculty Publications and Research

A sharp lower bound for discrepancy on R / Z is derived that resembles the upper bound due to LeVeque. An analogous bound is proved for discrepancy on Rk / Zk. These are discussed in the more general context of the discrepancy of probablity measures. As applications, the bounds are applied to Kronecker sequences and to a random walk on the torus.


Why The Player Never Wins In The Long Run At La Blackjack, Arthur T. Benjamin, Michael Lauzon '00, Christopher Moore '00 Jul 1999

Why The Player Never Wins In The Long Run At La Blackjack, Arthur T. Benjamin, Michael Lauzon '00, Christopher Moore '00

All HMC Faculty Publications and Research

No abstract provided in this article.


Convergence Of Random Walks On The Circle Generated By An Irrational Rotation, Francis E. Su Jan 1998

Convergence Of Random Walks On The Circle Generated By An Irrational Rotation, Francis E. Su

All HMC Faculty Publications and Research

Fix . Consider the random walk on the circle which proceeds by repeatedly rotating points forward or backward, with probability , by an angle . This paper analyzes the rate of convergence of this walk to the uniform distribution under ``discrepancy'' distance. The rate depends on the continued fraction properties of the number . We obtain bounds for rates when is any irrational, and a sharp rate when is a quadratic irrational. In that case the discrepancy falls as (up to constant factors), where is the number of steps in the walk. This is the first example of a sharp …


Optimization In Chemical Kinetics, Arthur T. Benjamin, Gordon J. Hogenson '92 Apr 1992

Optimization In Chemical Kinetics, Arthur T. Benjamin, Gordon J. Hogenson '92

All HMC Faculty Publications and Research

No abstract provided in this article.


Reliable Computation In The Presence Of Noise, Nicholas Pippenger Jan 1986

Reliable Computation In The Presence Of Noise, Nicholas Pippenger

All HMC Faculty Publications and Research

This talk concerns computation by systems whose components exhibit noise (that is, errors committed at random according to certain probabilistic laws). If we aspire to construct a theory of computation in the presence of noise, we must possess at the outset a satisfactory theory of computation in the absence of noise.

A theory that has received considerable attention in this context is that of the computation of Boolean functions by networks (with perhaps the strongest competition coming from the theory of cellular automata; see [G] and [GR]). The theory of computation by networks associates with any two sets Q and …