Richmond Home

2018–19 Colloquium Series

This Colloquium Series is sponsored by the Math and Computer Science Department. Unless otherwise noted, all talks take place in Jepson Hall Room 109 at 4:30 p.m. Starting at 4 p.m. light refreshments will be served in the lounge outside of Jepson 212 — please join us. Talks will be added as they are scheduled; please check back often.

Up Next

January 28: Laura Ellwein-FixVirginia Commonwealth University, Department of Mathematics

Title: TBA


April 1: Greg Morrisett, Cornell, Dean of Computing and Information Sciences

Title: TBA

April 15: Raymond Cheng, Old Dominion University, Department of Mathematics & Statistics

Title: A Fun Exercise in Probability

Abstract: We'll look at several dramatically different approaches to solving a simple problem involving coin tosses.

Past Events

November 26: Neal Bushaw, Virginia Commonwealth University, Department of Mathematics

Title: Turán Numbers and their Variants

Abstract:  Among the oldest questions in extremal graph theory lies a gem: For an n-vertex graph, how many edges can a graph possibly have while avoiding a particular subgraph? This problem dates back to the 1930s, and when it was answered (for complete graphs) by Pál Turán in the 1940s, the 'Turán Number' was born; given a graph G and a natural number n, we define the Turán Number as the maximum number of edges among all n vertex graphs with no subgraph isomorphic to G.  This problem not only has application within graph theory, but within other areas of mathematics and science.

In this general audience talk we'll talk about the history of graph theory in general, and this question specifically, as well a simple variation which leads to my own research ('What if instead of forbidding all copies of G, we allow one or two or ten?'). No graph theory background will be assumed -- I'll start by defining a graph, and build everything from there.

November 14: David Mimno, Cornell University, Information Science, Computing and Information Science **Special Wednesday Session**

Title: Putting the Data in Data Science

Abstract: "One of the most powerful conceptual tools in computing is abstraction. If you can recognize a class of problems that all share the same form, you can apply the same solution over and over. But this same power is also dangerous. We are tempted to put all of our attention on algorithms and treat data sets as interchangeable. I will describe several case studies in which small variations in input data can have surprisingly large impacts on the resulting outputs. I argue that data care -- far from being a trivial or menial task -- is often the most impactful part of a data science process."

November 12: Juraj Foldes, University of Virginia, Department of Mathematics

Title: Statistical Solutions of Differential Equations

Abstract: Many mathematical models possess very complicated or chaotic dynamics with solutions being extremely sensitive to parameters. In such situation, it is not feasible to follow one solution, but it is more practical to look at statistical properties of solutions. Famous complex systems arise in fluid dynamics, where two dimensional turbulent flows for large Reynold’s numbers can be approximated by solutions of incompressible Euler’s equation. As time increases, the solutions of Euler’s equation are increasing their disorder; however, at the same time, they are limited by the existence of infinitely many invariants. Analogously as the equilibrium statistical states are obtained in thermodynamics, we assume that the dynamics tend to limit profiles which maximize an entropy given the values of conserved quantities. These profiles, described by methods of Statistical Mechanics, are solutions of non-usual variational problems with infinite number of constraints. We will show how to analyze the problem and we will derive symmetry properties of entropy maximizers on symmetric domains. This is a joint work with Vladimír Šverák (University of Minnesota).

November 9: Evgenia Smirni, College of William and Mary, Computer Science Department ** Special Friday Session in Business School Room 114 at 4:00 PM **

Title: Getting a PhD in Computer Science: Myths and Facts

Abstract: A PhD in Computer Science can open doors to incredible career opportunities in academia or industry, such as corporate university R&D jobs, faculty positions, hi-tech startups, and senior-level product development, to name a few. However, enrolling in a graduate program is an impactful decision with life-changing consequences, and as a result, must be taken with as much information as possible. In fact, CS juniors and seniors may have numerous questions regarding a PhD: “Why should I get a PhD?”, or “How will a PhD help my career?”, or “Where should I get my PhD from?”, or "How are my Ph.D. studies going to be funded?". This talk is designed to especially answer such questions.

This talk will provide students with critical information on getting a graduate degree in CS, and the benefits of doing so at William & Mary. First, I will describe what a CS PhD entails, and demystify the myths and facts about getting a PhD. I will also discus the factors one must consider when selecting a PhD program. I will then provide information on William & Mary (W&M), and specifically, the research strengths of the Computer Science department at W&M. Towards the end, students will have an idea on what it is like to get a PhD in CS, and specifically, what it would be like to get a PhD at W&M CS.

November 5: Doron Levy, University of Maryland, Department of Mathematics

Title:The Role of the Immune Response in Chronic Myelogenous Leukemia

Abstract: Targeted drugs have significantly improved treatment of chronic myelogenous leukemia (CML). Yet, most patients are not cured for undetermined reasons. In this talk we will describe our work on modeling the immune response to CML, the goal being to harness the immune response to better improve therapies. Along the way, we will discuss some our results on cancer vaccines, drug resistance, and cancer stem cells.  We will also emphasize the necessity of integrating  a mixed bag of mathematical tools in order to address complex biological problems.

October 29: Lincoln Mullen, George Mason University, Department of History & Art History **LOCATION CHANGED TO JEPSON 118**

Title: Finding Biblical Quotations in Historical Newspaper Corpora

Abstract: "America's Public Bible" is interactive work of digital scholarship that identifies quotations of the Bible in U.S. newspapers. This talk will explain how the project works from a computational perspective, including the challenges of finding quotations, working with historical corpora, and creating the website. It will also discuss how those computational methods connect to research questions in American religious history and religious studies. The site enables a disciplined serendipity that turns up new and unusual examples that one would be unlikely to find with more traditional methods, but which also rigorously contextualizes those examples. This method helps researchers make better evaluations of whether the phenomena under study are typical or unusual.

October 22: Zerotti Woods, University of Georgia, Department of Mathematics

Title: The Effects of Ill Conditioning in Neural Network

Abstract: "Deep Neural Networks have shown much success in solving problems in a diverse set of applications (i.e. computer vision, computational biology, finance, etc). Although we have proof about universal approximation of these networks the problem of training them is known to be very difficult. The ill conditioning of the hessian has been shown to be one of the sources of this difficulty. In this talk we will discuss problems and neural network architecture that causes a ill conditioned hessian. I will also discuss how this can interplay with analysis of high frequency telemetry data taken from a malaria infection on Non Human Primates."

October 8: Dominique Guillot, University of Delaware, Department of Mathematical Sciences

Title: Positivity Preserver Problems

Abstract:  "Determining which transformations map the set of positive semidefinite matrices into itself is a classical problem that continues to attract a lot of attention. I will give a historical account of matrix positivity and of operations that preserve it, and will discuss several applications of positivity preservers in geometry, combinatorics, and statistics. The talk should be accessible to anyone with a basic knowledge of linear algebra and calculus."

September 10: Student Summer Research Presentations II

Stephen Owen, Berke Nuri, Abhishek Shilpakar (Doug Szajda, mentor); Sophie Borchart, Palmer Robins, Jonathan Rodriguez (Jory Denny, mentor); Caleb Brooks, Aaqil Zakarya (Jory Denny, mentor); Basil Arafat (Jory Denny, mentor); Jojo Zhou (Jory Denny, mentor); Michael Bonifonte (Lewis Barnett, mentor); Hammed Hassan (Lewis Barnett, mentor)

September 3: Student Summer Research Presentations I

Diksha Kataria, Xinxuan Zhang, Shiyi Wang, Alamby He (Paul Kvam, mentor); Salar Ather (Taylor Arnold, mentor); Shuzhi Zeng & Nayzaw Aung Win (Lester Caudill, mentor); Maxine Xin (Prateek Bhakta, mentor); Sinan Kivanc (Prateek Bhakta, mentor); Miles Clikeman (Heather Russell, mentor)