Seminars and Colloquia by Series

On Estimation in the Nonparametric Bradley Terry Model

Series
Job Candidate Talk
Time
Monday, February 27, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Sabyasachi ChatterjeeUniversity of Chicago
We consider the problem of estimating pairwise comparison probabilities in a tournament setting after observing every pair of teams play with each other once. We assume the true pairwise probability matrix satisfies a stochastic transitivity condition which is popular in the Social Sciences.This stochastic transitivity condition generalizes the ubiquitous Bradley- Terry model used in the ranking literature. We propose a computationally efficient estimator for this problem, borrowing ideas from recent work on Shape Constrained Regression. We show that the worst case rate of our estimator matches the best known rate for computationally tractable estimators. Additionally we show our estimator enjoys faster rates of convergence for several sub parameter spaces of interest thereby showing automatic adaptivity. We also study the missing data setting where only a fraction of all possible games are observed at random.

A Fast Algorithm for Elastic Shape Distances Between Closed Planar Curves

Series
Applied and Computational Mathematics Seminar
Time
Monday, February 27, 2017 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Gunay Dogan National Institute of Standards and Technology
For many problems in science and engineering, one needs to quantitatively compare shapes of objects in images, e.g., anatomical structures in medical images, detected objects in images of natural scenes. One might have large databases of such shapes, and may want to cluster, classify or compare such elements. To be able to perform such analyses, one needs the notion of shape distance quantifying dissimilarity of such entities. In this work, we focus on the elastic shape distance of Srivastava et al. [PAMI, 2011] for closed planar curves. This provides a flexible and intuitive geodesic distance measure between curve shapes in an appropriate shape space, invariant to translation, scaling, rotation and reparametrization. Computing this distance, however, is computationally expensive. The original algorithm proposed by Srivastava et al. using dynamic programming runs in cubic time with respect to the number of nodes per curve. In this work, we propose a new fast hybrid iterative algorithm to compute the elastic shape distance between shapes of closed planar curves. The asymptotic time complexity of our iterative algorithm is O(N log(N)) per iteration. However, in our experiments, we have observed almost a linear trend in the total running times depending on the type of curve data.

Southeast Geometry Seminar

Series
Other Talks
Time
Sunday, February 26, 2017 - 08:55 for 8 hours (full day)
Location
Skiles 006
Speaker
six speakers on topics in geometryfrom various universities
Mozghan Entekhabi (Wichita State University) Radial Limits of Bounded Nonparametric Prescribed Mean Curvature Surfaces ; Miyuki Koiso (Kyushu University) Stability and bifurcation for surfaces with constant mean curvature ; Vladimir Oliker (Emory University) Freeform lenses, Jacobian equations, and supporting quadric method(SQM) ; Sungho Park (Hankuk University of Foreign Studies) Circle-foliated minimal and CMC surfaces in S^3 ; Yuanzhen Shao (Purdue University) Degenerate and singular elliptic operators on manifolds with singularities ; Ray Treinen (Texas State University) Surprising non-uniqueness for the 2D floating ball ; See http://www.math.uab.edu/sgs/ for abstracts and further details.

Georgia Scientific Computing Symposium 2017

Series
Applied and Computational Mathematics Seminar
Time
Saturday, February 25, 2017 - 09:00 for 1 hour (actually 50 minutes)
Location
University of Georgia, Paul D. Coverdell Center for Biomedical & Health Sciences, Athens, GA 30602
Speaker
Haomin ZhouGT Math
The Georgia Scientific Computing Symposium (GSCS) is a forum for professors, postdocs, graduate students and other researchers in Georgia to meet in an informal setting, to exchange ideas, and to highlight local scientific computing research. The symposium has been held every year since 2009 and is open to the entire research community. The format of the day-long symposium is a set of invited presentations, poster sessions and a poster blitz, and plenty of time to network with other attendees. More information at http://euler.math.uga.edu/cms/GSCS-2017

Experimental Analysis of Combinatorial Sequences

Series
Combinatorics Seminar
Time
Friday, February 24, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jay PantoneDartmouth College
In enumerative combinatorics, it is quite common to have in hand a number of known initial terms of a combinatorial sequence whose behavior you'd like to study. In this talk we'll describe two techniques that can be used to shed some light on the nature of a sequence using only some known initial terms. While these methods are, on the face of it, experimental, they often lead to rigorous proofs. As we talk about these two techniques -- automated conjecturing of generating functions, and the method of differential approximation -- we'll exhibit their usefulness through a variety of combinatorial topics, including matchings, permutation classes, and inversion sequences.

A classical Hamiltonian model for high harmonic generation

Series
Dynamical Systems Working Seminar
Time
Friday, February 24, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 254
Speaker
Simon BermanSchool of Physics
In a high harmonic generation (HHG) experiment, an intense laser pulse is sent through an atomic gas, and some of that light is converted to very high harmonics through the interaction with the gas. The spectrum of the emitted light has a particular, nearly universal shape. In this seminar, I will describe my efforts to derive a classical reduced Hamiltonian model to capture this phenomenon. Beginning with a parent Hamiltonian that yields the equations of motion for a large collection of atoms interacting self-consistently with the full electromagnetic field (Lorentz force law + Maxwell's equations), I will follow a sequence of reductions that lead to a reduced Hamiltonian which is computationally tractable yet should still retain the essential physics. I will conclude by pointing out some of the still-unresolved issues with the model, and if there's time I will discuss the results of some preliminary numerical simulations.

Discrete excitable media

Series
Stochastics Seminar
Time
Thursday, February 23, 2017 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
David SivakoffOhio State University
Excitable media are characterized by a local tendency towards synchronization, which can lead to waves of excitement through the system. Two classical discrete, deterministic models of excitable media are the cyclic cellular automaton and Greenberg-Hastings models, which have been extensively studied on lattices, Z^d. One is typically interested in whether or not sites are excited (change states) infinitely often (fluctuation vs fixation), and if so, whether the density of domain walls between disagreeing sites tends to 0 (clustering). We introduce a new comparison process for the 3-color variants of these models, which allows us to study the asymptotic rate at which a site gets excited. In particular, for a class of infinite trees we can determine whether the rate is 0 or positive. Using this comparison process, we also analyze a new model for pulse-coupled oscillators in one dimension, introduced recently by Lyu, called the firefly cellular automaton (FCA). Based on joint works with Lyu and Gravner.

Braid and Knot Theory

Series
Geometry Topology Student Seminar
Time
Thursday, February 23, 2017 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sudipta KolayGeorgia Tech
Braid and knot theory in 3-dimensional Euclidean space are related by classical theorems of Alexander and Markov. We will talk about closed braids in higher dimensions, and generalizations of Alexander's theorem.

Pages