SearcharxivSearch

arXiv · 1803.00595

Admission predictors for success in a mathematics graduate program

Abstract

There are many factors that can influence the outcome for students in a mathematics PhD program: bachelor's GPA (BGPA), bachelor's major, GRE scores, gender, Under-Represented Minority (URM) status, institution tier, etc. Are these variables equally important predictors of a student's likelihood of succeeding in a math PhD program? In this paper, we present and analyze admission data of students from different groups entering a math PhD program at a southern California university. We observe that some factors correlate with success in the PhD program (defined as obtaining a PhD degree within a time-limit). According to our analysis, GRE scores correlate with success, but interestingly, the verbal part of the GRE score has a higher predictive power compared to the quantitative part. Further, we observe that undergraduate student GPA does not correlate with success (there is even a slight negative slope in the relationship between GPA and the probability of success). This counterintuitive observation is explained once undergraduate institutions are separated by tiers: students from "higher tiers" have undergone a more rigorous training program; they on average have a slightly lower GPA but run a slightly higher probability to succeed. Finally, a gender gap is observed in the probability to succeed with female students having a lower probability to finish with a PhD despite the same undergraduate performance, compared to males. This gap is reversed if we only consider foreign graduate students. It is our hope that this study will encourage other universities to perform similar analyses, in order to design better admission and retention strategies for Math PhD programs.

Explore related subjects

Keep this discovery

BibTeXRIS

Timmy Ma, Karen E. Wood, Di Xu, Patrick Guidotti, Alessandra Pantano, Natalia L. Komarova. 2018-03-01. Admission predictors for success in a mathematics graduate program. https://arxiv.org/abs/1803.00595

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO