Seminars and Colloquia by Series

Wednesday, February 14, 2018 - 11:00 , Location: Skiles 006 , Omer Angel , University of British Columbia , angel@math.ubc.ca , Organizer: Michael Damron
I will discuss two projects concerning Mallows permutations, with Ander Holroyd, Tom Hutchcroft and Avi Levy.  First, we relate the Mallows permutation to stable matchings, and percolation on bipartite graphs. Second, we study the scaling limit of the cycles in the Mallows permutation, and relate it to diffusions and continuous trees.
Thursday, February 8, 2018 - 15:00 , Location: Skiles 006 , Ian McKeague , Columbia University , Organizer: Mayya Zhilova
It has been conjectured that phenomena as diverse as the behavior of large "self-organizing" neural networks, and causality in standard model particle physics, can be explained by suitably rich algebras acting on themselves. In this talk I discuss the asymptotics of large causal tree diagrams that combine freely independent elements of such algebras. The Marchenko-Pastur law and Wigner's semicircle law are shown to emerge as limits of a normalized sum-over-paths of non-negative elements assigned to the edges of causal trees. The results are established in the setting of non-commutative probability. Trees with classically independent positive edge weights (random multiplicative cascades) were originally proposed by Mandelbrot as a model displaying the fractal features of turbulence. The novelty of the present work is the use of non-commutative (free) probability to allow the edge weights to take values in an algebra.
Thursday, February 8, 2018 - 15:00 , Location: Skiles 006 , Ian McKeague , Columbia University , Organizer: Mayya Zhilova
It has been conjectured that phenomena as diverse as the behavior of large "self-organizing" neural networks, and causality in standard model particle physics, can be explained by suitably rich algebras acting on themselves. In this talk I discuss the asymptotics of large causal tree diagrams that combine freely independent elements of such algebras. The Marchenko-Pastur law and Wigner's semicircle law are shown to emerge as limits of a normalized sum-over-paths of non-negative elements assigned to the edges of causal trees. The results are established in the setting of non-commutative probability. Trees with classically independent positive edge weights (random multiplicative cascades) were originally proposed by Mandelbrot as a model displaying the fractal features of turbulence. The novelty of the present work is the use of non-commutative (free) probability to allow the edge weights to take values in an algebra.
Thursday, January 25, 2018 - 15:05 , Location: Skiles 006 , Siva Maguluri , Georgia Insitute of Technology , siva.theja@gatech.edu , Organizer: Michael Damron
Today's era of cloud computing is powered by massive data centers. A data center network enables the exchange of data in the form of packets among the servers within these data centers. Given the size of today's data centers, it is desirable to design low-complexity scheduling algorithms which result in a fixed average packet delay, independent of the size of the data center. We consider the scheduling problem in an input-queued switch, which is a good abstraction for a data center network. In particular, we study the queue length (equivalently, delay) behavior under the so-called MaxWeight scheduling algorithm, which has low computational complexity. Under various traffic patterns, we show that the algorithm achieves optimal scaling of the heavy-traffic scaled queue length with respect to the size of the switch. This settles one version of an open conjecture that has been a central question in the area of stochastic networks. We obtain this result by using a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expected total queue length in the network, in steady-state.  
Thursday, January 25, 2018 - 15:05 , Location: Skiles 006 , Siva Maguluri , Georgia Insitute of Technology , siva.theja@gatech.edu , Organizer: Michael Damron
Today's era of cloud computing is powered by massive data centers. A data center network enables the exchange of data in the form of packets among the servers within these data centers. Given the size of today's data centers, it is desirable to design low-complexity scheduling algorithms which result in a fixed average packet delay, independent of the size of the data center. We consider the scheduling problem in an input-queued switch, which is a good abstraction for a data center network. In particular, we study the queue length (equivalently, delay) behavior under the so-called MaxWeight scheduling algorithm, which has low computational complexity. Under various traffic patterns, we show that the algorithm achieves optimal scaling of the heavy-traffic scaled queue length with respect to the size of the switch. This settles one version of an open conjecture that has been a central question in the area of stochastic networks. We obtain this result by using a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expected total queue length in the network, in steady-state.  
Thursday, November 30, 2017 - 15:05 , Location: Skiles 006 , Matthew Junge , Duke University , jungem@math.duke.edu , Organizer:
Cars are placed with density p on the lattice. The remaining vertices are parking spots that can fit one car. Cars then drive around at random until finding a parking spot. We study the effect of p on the availability of parking spots and observe some intriguing behavior at criticality. Joint work with Michael Damron, Janko Gravner, Hanbeck Lyu, and David Sivakoff. arXiv id: 1710.10529.
Thursday, November 9, 2017 - 15:05 , Location: Skiles 006 , Elliot Paquette , The Ohio State University , paquette.30@osu.edu , Organizer: Lutz Warnke
We study an online algorithm for making a well—equidistributed random set of points in an interval, in the spirit of "power of choice" methods. Suppose finitely many distinct points are placed on an interval in any arbitrary configuration. This configuration of points subdivides the circle into a finite number of intervals. At each time step, two points are sampled uniformly from the interval. Each of these points lands within some pair of intervals formed by the previous configuration. Add the point that falls in the larger interval to the existing configuration of points, discard the other, and then repeat this process. We then study this point configuration in the sense of its largest interval, and discuss other "power of choice" type modifications. Joint work with Pascal Maillard.
Thursday, November 2, 2017 - 15:05 , Location: Skiles 006 , Wei-Kuo Chen , University of Minnesota , wkchen@umn.edu , Organizer: Michael Damron
The Sherrington-Kirkpatirck (SK) model is a mean-field spin glass introduced by theoretical physicists in order to explain the strange behavior of certain alloys, such as CuMn. Despite of its seemingly simple formulation, it was conjectured to possess a number of profound properties. This talk will be focused on the energy landscapes of the SK model and the mixed p-spin model with both Ising and spherical configuration spaces. We will present Parisi formule for their maximal energies followed by descriptions of the energy landscapes near the maximum energy. Based on joint works with  A. Auffinger, M. Handschy, G. Lerman, and A. Sen.
Thursday, October 26, 2017 - 15:05 , Location: Skiles 006 , Todd Kuffner , Washington University in St. Louis , kuffner@wustl.edu , Organizer: Mayya Zhilova
When considering smooth functionals of dependent data, block bootstrap methods have enjoyed considerable success in theory and application. For nonsmooth functionals of dependent data, such as sample quantiles, the theory is less well-developed. In this talk, I will present a general theory of consistency and optimality, in terms of achieving the fastest convergence rate, for block bootstrap distribution estimation for sample quantiles under mild strong mixing assumptions. The case of density estimation will also be discussed. In contrast to existing results, we study the block bootstrap for varying numbers of blocks. This corresponds to a hybrid between the subsampling bootstrap and the moving block bootstrap (MBB). Examples of `time series’ models illustrate the benefits of optimally choosing the number of blocks. This is joint work with Stephen M.S. Lee (University of Hong Kong) and Alastair Young (Imperial College London).
Thursday, October 19, 2017 - 15:05 , Location: Skiles 006 , Yao Xie , ISyE, Georgia Institute of Technology , Organizer: Mayya Zhilova
We present a unified framework for sequential low-rank matrix completion and estimation, address the joint goals of uncertainty quantification (UQ) and statistical design. The first goal of UQ aims to provide a measure of uncertainty of estimated entries in the unknown low-rank matrix X, while the second goal of statistical design provides an informed sampling or measurement scheme for observing the entries in X. For UQ, we adopt a Bayesian approach and assume a singular matrix-variate Gaussian prior the low-rank matrix X which enjoys conjugacy. For design, we explore deterministic design from information-theoretic coding theory. The effectiveness of our proposed methodology is then illustrated on applications to collaborative filtering.

Pages