BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20190426T143000
DTEND;TZID=America/New_York:20200426T153000
DTSTAMP:20260502T070135
CREATED:20240212T100818Z
LAST-MODIFIED:20240221T092817Z
UID:10001958-1556289000-1587915000@cmsa.fas.harvard.edu
SUMMARY:4/26/2019 General Relativity Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/4-26-2019-general-relativity-seminar/
CATEGORIES:General Relativity Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200203T120000
DTEND;TZID=America/New_York:20200203T130000
DTSTAMP:20260502T070135
CREATED:20240212T091104Z
LAST-MODIFIED:20240212T091104Z
UID:10001903-1580731200-1580734800@cmsa.fas.harvard.edu
SUMMARY:2/3/2020 Math-Physics
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-3-2020-math-physics/
CATEGORIES:Mathematical Physics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200203T120000
DTEND;TZID=America/New_York:20200203T130000
DTSTAMP:20260502T070135
CREATED:20240212T091951Z
LAST-MODIFIED:20240212T091951Z
UID:10001909-1580731200-1580734800@cmsa.fas.harvard.edu
SUMMARY:2/3/2020 Math-Physics Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-3-2020-math-physics-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200205T103000
DTEND;TZID=America/New_York:20200205T120000
DTSTAMP:20260502T070135
CREATED:20240212T092131Z
LAST-MODIFIED:20240307T094352Z
UID:10001911-1580898600-1580904000@cmsa.fas.harvard.edu
SUMMARY:2/5/2020 Quantum Matter seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-5-2020-quantum-matter-seminar/
CATEGORIES:Quantum Matter
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200205T163000
DTEND;TZID=America/New_York:20200205T173000
DTSTAMP:20260502T070135
CREATED:20240212T090826Z
LAST-MODIFIED:20240507T204003Z
UID:10001902-1580920200-1580923800@cmsa.fas.harvard.edu
SUMMARY:Gentle Measurement of Quantum States and Differential Privacy
DESCRIPTION:Speaker: Scott Aaronson (University of Texas at Austin) \nTitle: Gentle Measurement of Quantum States and Differential Privacy \nAbstract: I’ll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states without damaging them too much (“gentle measurement”)\, and how to provide statistical data without leaking too much about individuals (“differential privacy\,” an area of classical CS). This connection leads\, among other things\, to a new protocol for “shadow tomography” of quantum states (that is\, answering a large number of questions about a quantum state given few copies of it). Based on joint work with Guy Rothblum (arXiv:1904.08747).
URL:https://cmsa.fas.harvard.edu/event/2-5-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-02.05.20-1-1-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200206T103000
DTEND;TZID=America/New_York:20200206T120000
DTSTAMP:20260502T070135
CREATED:20240212T091828Z
LAST-MODIFIED:20240212T091828Z
UID:10001908-1580985000-1580990400@cmsa.fas.harvard.edu
SUMMARY:2/06/2020 Condensed Matter Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-06-2020-condensed-matter-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200207T103000
DTEND;TZID=America/New_York:20200207T120000
DTSTAMP:20260502T070135
CREATED:20240212T090621Z
LAST-MODIFIED:20240307T100558Z
UID:10001901-1581071400-1581076800@cmsa.fas.harvard.edu
SUMMARY:2/7/2020 General Relativity
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-7-2020-general-relativity/
CATEGORIES:General Relativity Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200207T163000
DTEND;TZID=America/New_York:20200207T173000
DTSTAMP:20260502T070135
CREATED:20240212T090243Z
LAST-MODIFIED:20240507T203547Z
UID:10001899-1581093000-1581096600@cmsa.fas.harvard.edu
SUMMARY:A Compact\, Logical Approach to Large-Market Analysis
DESCRIPTION:Speaker: Scott Duke Kominers (Harvard)\n\nTitle: A Compact\, Logical Approach to Large–Market Analysis\n\nAbstract: In game theory\, we often use infinite models to represent “limit” settings\, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that\, while introduced for simplicity\, play a real role in the analysis. Here\, we show how to extend key results from (finite) models of matching\, games on graphs\, and trading networks to infinite models by way of Logical Compactness\, a core result from Propositional Logic. Using Compactness\, we prove the existence of man-optimal stable matchings in infinite economies\, as well as strategy-proofness of the man-optimal stable matching mechanism. We then use Compactness to eliminate the need for a finite start time in a dynamic matching model. Finally\, we use Compactness to prove the existence of both Nash equilibria in infinite games on graphs and Walrasian equilibria in infinite trading networks.
URL:https://cmsa.fas.harvard.edu/event/2-12-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-02.12.20-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200210T120000
DTEND;TZID=America/New_York:20200210T130000
DTSTAMP:20260502T070135
CREATED:20240212T091426Z
LAST-MODIFIED:20240212T091426Z
UID:10001905-1581336000-1581339600@cmsa.fas.harvard.edu
SUMMARY:2/10/2020 Math-Physics Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-10-2020-math-physics-seminar/
CATEGORIES:Mathematical Physics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200212T103000
DTEND;TZID=America/New_York:20200212T120000
DTSTAMP:20260502T070135
CREATED:20240212T084359Z
LAST-MODIFIED:20240212T084359Z
UID:10001894-1581503400-1581508800@cmsa.fas.harvard.edu
SUMMARY:2/12/2020 Quantum Matter Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-12-2020-quantum-matter-seminar/
CATEGORIES:Quantum Matter
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200213T103000
DTEND;TZID=America/New_York:20200213T120000
DTSTAMP:20260502T070135
CREATED:20240212T084133Z
LAST-MODIFIED:20240212T084133Z
UID:10001893-1581589800-1581595200@cmsa.fas.harvard.edu
SUMMARY:2/13/2020 Condensed Matter Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-13-2020-condensed-matter-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200214T103000
DTEND;TZID=America/New_York:20200214T120000
DTSTAMP:20260502T070135
CREATED:20240212T085126Z
LAST-MODIFIED:20240212T085126Z
UID:10001896-1581676200-1581681600@cmsa.fas.harvard.edu
SUMMARY:2/14/2020 General Relativity Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-14-2020-general-relativity-seminar/
CATEGORIES:General Relativity Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T103000
DTEND;TZID=America/New_York:20200219T120000
DTSTAMP:20260502T070135
CREATED:20240212T083639Z
LAST-MODIFIED:20240212T083639Z
UID:10001891-1582108200-1582113600@cmsa.fas.harvard.edu
SUMMARY:2/19/2020 Quantum Matter Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-19-2020-quantum-matter-seminar/
CATEGORIES:Quantum Matter
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T163000
DTEND;TZID=America/New_York:20200219T173000
DTSTAMP:20260502T070135
CREATED:20240212T081736Z
LAST-MODIFIED:20240507T202728Z
UID:10001886-1582129800-1582133400@cmsa.fas.harvard.edu
SUMMARY:The Cubical Route to Understanding Groups
DESCRIPTION:Speaker: Daniel Wise (McGill University)\n\nTitle: The Cubical Route to Understanding Groups\n\nAbstract: Cube complexes have come to play an increasingly central role within geometric group theory\, as their connection to right-angled Artin groups provides a powerful combinatorial bridge between geometry and algebra. This talk will introduce nonpositively curved cube complexes\, and then describe the developments that culminated in the resolution of the virtual Haken conjecture for 3-manifolds and simultaneously dramatically extended our understanding of many infinite groups.
URL:https://cmsa.fas.harvard.edu/event/02-21-2020-colloquium/
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-2.26.20-1583x2048-1-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T171500
DTEND;TZID=America/New_York:20200219T181500
DTSTAMP:20260502T070135
CREATED:20240212T082420Z
LAST-MODIFIED:20240507T203004Z
UID:10001888-1582132500-1582136100@cmsa.fas.harvard.edu
SUMMARY:Quantum Money from Lattices
DESCRIPTION:Speaker: Peter Shor (MIT)\n\nTitle: Quantum Money from Lattices\n\nAbstract: Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the “serial number” of the money is)\, but which cannot be duplicated\, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have been made for quantum money protocols. We will discuss the history of quantum money and give a protocol which cannot be broken unless lattice cryptosystems are insecure.
URL:https://cmsa.fas.harvard.edu/event/02-19-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/P.ShorColloquium-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200220T103000
DTEND;TZID=America/New_York:20200220T120000
DTSTAMP:20260502T070135
CREATED:20240212T083840Z
LAST-MODIFIED:20240212T083840Z
UID:10001892-1582194600-1582200000@cmsa.fas.harvard.edu
SUMMARY:2/20/2020 Condensed Matter Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-20-2020-condensed-matter-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200221T103000
DTEND;TZID=America/New_York:20200221T113000
DTSTAMP:20260502T070135
CREATED:20240212T082037Z
LAST-MODIFIED:20240212T082037Z
UID:10001887-1582281000-1582284600@cmsa.fas.harvard.edu
SUMMARY:02/21/2020 General Relativity Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/02-21-2020-general-relativity-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200224T120000
DTEND;TZID=America/New_York:20200224T130000
DTSTAMP:20260502T070135
CREATED:20240212T091651Z
LAST-MODIFIED:20240212T091651Z
UID:10001906-1582545600-1582549200@cmsa.fas.harvard.edu
SUMMARY:2/24/2020 Math Physics Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-24-2020-math-physics-seminar/
CATEGORIES:Mathematical Physics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200225T150000
DTEND;TZID=America/New_York:20200225T160000
DTSTAMP:20260502T070135
CREATED:20240212T081000Z
LAST-MODIFIED:20240212T081000Z
UID:10001883-1582642800-1582646400@cmsa.fas.harvard.edu
SUMMARY:2/25/2020 Fluid Dynamics
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/2-25-2020-fluid-dynamics/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200225T173300
DTEND;TZID=America/New_York:20200225T173300
DTSTAMP:20260502T070135
CREATED:20240213T102444Z
LAST-MODIFIED:20240213T102444Z
UID:10002421-1582651980-1582651980@cmsa.fas.harvard.edu
SUMMARY:Fluid Dynamics Seminar
DESCRIPTION:Beginning immediately\, until at least April 30\, all seminars will take place virtually\, through Zoom. Links to connect can be found in the schedule below once they are created. \nIn the Spring 2019 Semester\, the Center of Mathematical Sciences and Applications will be hosting a seminar on Fluid Dynamics. The seminar will take place on Wednesdays from 3:00-4:00pm in CMSA G10. \nSpring 2020:\n\n\n\nDate\nSpeaker\nTitle/Abstract\n\n\n2/25/2020\nKeaton Burns\, MIT\nTitle: Flexible spectral simulations of low-Mach-number astrophysical fluids \nAbstract: Fluid dynamical processes are key to understanding the formation and evolution of stars and planets. While the astrophysical community has made exceptional progress in simulating highly compressible flows\, models of low-Mach-number stellar and planetary flows typically use simplified equations based on numerical techniques for incompressible fluids. In this talk\, we will discuss improved numerical models of three low-Mach-number astrophysical phenomena: tidal instabilities in binary neutron stars\, waves and convection in massive stars\, and ice-ocean interactions in icy moons. We will cover the basic physics of these systems and how ongoing additions to the open-source Dedalus Project are enabling their efficient simulation in spherical domains with spectral accuracy\, implicit timestepping\, phase-field methods\, and complex equations of state.\n\n\n3/4/2020 \nG02\n\n\n\n\n3/11/2020\n\n\n\n\n3/18/2020\n\n\n\n\n3/25/2020\n\n\n\n\n4/1/2020\n\n\n\n\n4/8/2020 G02\n\n\n\n\n4/15/2020\n\n\n\n\n4/22/2020\n\n\n\n\n4/29/2020 \nG02\n\n\n\n\n5/6/2020\n\n\n\n\n5/13/2020\n\n\n\n\n\nFall 2019:\n\n\n\nDate\nSpeaker\nTitle/Abstract\n\n\n9/18/2019\nJiawei Zhuang (Harvard)\nTitle: Simulation of 2-D turbulent advection at extreme accuracy with machine learning and differentiable programming \n Abstract: The computational cost of fluid simulations grows rapidly with grid resolution. With the recent slow-down of Moore’s Law\, it can take many decades for 10x higher resolution grids to become affordable. To break this major barrier in high-performance scientific computing\, we used a data-driven approach to learn an optimal numerical solver that can retain high-accuracy at much coarser grids. We applied this method to 2-D turbulent advection and achieved 4x effective resolution than traditional high-order flux-limited advection solvers. The machine learning component is tightly integrated with traditional finite-volume schemes and can be trained via an end-to-end differentiable programming framework. The model can achieve near-peak FLOPs on CPUs and accelerators via convolutional filters.\n\n\n9/25/2019\nYantao Yang (Peking University)\nTitle: Double diffusive convection and thermohaline staircases  \nAbstract: Double diffusive convection (DDC)\, i.e. the buoyancy-driven flow with fluid density depending on two scalar components\, is omnipresent in many natural and engineering environments. In ocean this is especially true since the seawater density is mainly determined by temperature and salinity. In upper water of both (sub-) tropical and polar oceans\, DDC causes the intriguing thermohaline staircases\, which consist of alternatively stacked convection layers and sharp interfaces with high gradients of temperature and salinity. In this talk\, we will focus on the fingering DDC usually found in (sub-)tropical ocean\, where the mean temperature and salinity decrease with depth. We numerically investigate the formation and the transport properties of finger structures and thermohaline staircases. Moreover\, we show that multiple states exit for the exactly same global condition\, and individual finger layers and finger layers within staircases exhibit very different transport behaviors.\n\n\n10/2/2019\nNo talk\n\n\n\n10/9/2019\nSamuel Rudy (MIT)\nTitle: Data-driven methods for discovery of partial differential equations and forecasting \nAbstract: A critical challenge in many modern scientific disciplines is deriving governing equations and forecasting models from data where derivation from first principals is intractable. The problem of learning dynamics from data is complicated when data is corrupted by noise\, when only partial or indirect knowledge of the state is available\, when dynamics exhibit parametric dependencies\, or when only small volumes of data are available. In this talk I will discuss several methods for constructing models of dynamical systems from data including sparse identification for partial differential equations with or without parametric dependencies and approximation of dynamical systems governing equations using neural networks. Limitations of each approach and future research directions will also be discussed.​\n\n\n10/16/2019\nNo talk\n\n\n\n10/23/2019\nKimee Moore (Harvard)\nTitle: Using magnetic fields to investigate Jupiter’s fluid interior \nAbstract: The present-day interior structure of a planet is an important reflection of the formation and subsequent thermal evolution of that planet. However\, despite decades of spacecraft missions to a variety of target bodies\, the interiors of most planets in our Solar System remain poorly constrained. In this talk\, I will discuss how actively generated planetary magnetic fields (dynamos) can provide important insights into the interior properties and evolution of fluid planets. Using Jupiter as a case study\, I will present new results from the analysis of in situ spacecraft magnetometer data from the NASA Juno Mission (currently in orbit about Jupiter). The spatial morphology of Jupiter’s magnetic field shows surprising hemispheric asymmetry\, which may be linked to the dissolution of Jupiter’s rocky core in liquid metallic hydrogen. I also report the first definitive detection of time-variation (secular variation) in a planetary dynamo beyond Earth. This time-variation can be explained by the advection of Jupiter’s magnetic field by the zonal winds\, which places a lower bound on the velocity of Jupiter’s winds at depth. These results provide an important complement to other analysis techniques\, as gravitational measurements are currently unable to uniquely distinguish between deep and shallow wind scenarios\, and between solid and dilute core scenarios. Future analysis will continue to resolve Jupiter’s interior\, providing broader insight into the physics of giant planets\, with implications for the formation of our Solar System.\n\n\n10/30/2019\nNo Talk\n\n\n\n11/6/2019\nFederico Toschi (Eindhoven University of Technology)\nTitle: Deep learning and reinforcement learning for turbulence \nAbstract: This talk tells two stories. \nChapter 1: We investigate the capability of a state-of-the-art deep neural model at learning features of turbulent velocity signals. Deep neural network (DNN) models are at the center of the present machine learning revolution. The set of complex tasks in which they over perform human capabilities and best algorithmic solutions grows at an impressive rate and includes\, but it is not limited to\, image\, video and language analysis\, automated control\, and even life science modeling. Besides\, deep learning is receiving increasing attention in connection to a vast set of problems in physics where quantitatively accurate outcomes are expected. We consider turbulent velocity signals\, spanning decades in Reynolds numbers\, which have been generated via shell models for the turbulent energy cascade. Given the multi-scale nature of the turbulent signals\, we focus on the fundamental question of whether a deep neural network (DNN) is capable of learning\, after supervised training with very high statistics\, feature extractors to address and distinguish intermittent and multi-scale signals. Can the DNN measure the Reynolds number of the signals? Which feature is the DNN learning? \nChapter 2: Thermally driven turbulent flows are common in nature and in industrial applications. The presence of a (turbulent) flow can greatly enhance the heat transfer with respect to its conductive value. It is therefore extremely important -in fundamental and applied perspective- to understand if and how it is possible to control the heat transfer in thermally driven flows. In this work\, we aim at maintaining a Rayleigh–Bénard convection (RBC) cell in its conductive state beyond the critical Rayleigh number for the onset of convection. We specifically consider controls based on local modifications of the boundary temperature (fluctuations). We take advantage of recent developments in Artificial Intelligence and Reinforcement Learning (RL) to find -automatically- efficient non-linear control strategies. We train RL agents via parallel\, GPU-based\, 2D lattice Boltzmann simulations. Trained RL agents are capable of increasing the critical Rayleigh number of a factor 3 in comparison with state-of-the-art linear control approaches. Moreover\, we observe that control agents are able to significantly reduce the convective flow also when the conductive state is unobtainable. This is achieved by finding and inducing complex flow fields.\n\n\n11/13/2019 \n  \n2:10pm \nG02\nMartin Lellep (Philipps University of Marburg\, Germany)\nTitle: Predictions of relaminarisation in turbulent shear flows using deep learning \n  \nAbstract: Given the increasing performance of deep learning algorithms in tasks such as classification during the last years and the vast amount of data that can be generated in turbulence research\, I present one application of deep learning to fluid dynamics in this talk. We train a deep learning machine learning model to classify if turbulent shear flow becomes laminar a certain amount of time steps ahead in the future. Prior to this\, we use a 2D toy example to develop an understanding how the performance of the deep learning algorithm depends on hyper parameters and how to understand the errors. The performance of both algorithms is high and therefore opens up further steps towards the interpretation of the results in future work.\n\n\n11/19/2019 \nTuesday \n3-4 pm \nPierce Hall 209\, 29 Oxford Street \nDetlef Lohse (University of Twente)\nTitle: Rayleigh vs. Marangoni Abstract: In this talk I will show several examples of an interesting and surprising competition between buoyancy and Marangoni forces. First\, I will introduce the audience to the jumping oil droplet – and its sudden death – in a density stratified liquid consisting of water in the bottom and ethanol in the top : After sinking for about a minute\, before reaching the equilibrium the droplet suddenly jumps up thanks to the Marangoni forces. This phenomenon repeats about 30-50 times\, before the droplet falls dead all the sudden. We explain this phenomenon and explore the phase space where it occurs. \nNext\, I will focus on the evaporation of multicomponent droplets\, for which the richness of phenomena keeps surprising us. I will show and explain several of such phenomena\, namely evaporation-triggered segregation thanks to either weak solutal Marangoni flow or thanks to gravitational effects. The dominance of the latter implies that sessile droplets and pending droplets show very different evaporation behavior\, even for Bond number << 1. I will also explain the full phase diagram in the Marangoni number vs Rayleigh number phase space\, and show where Rayleigh convections rolls prevail\, where Marangoni convection rolls prevail\, and where they compete. \nThe research work shown in this talks combines experiments\, numerical simulations\, and theory. It has been done by and in collaboration with Yanshen Li\, Yaxing Li\, and Christian Diddens\, and many others.\n\n\n11/20/2019\n\nTime: 3:00-3:35 pm \nSpeaker:  Haoran Liu \nTitle: Applications of Phase Field method: drop impact and multiphase turbulence  \nAbstract: Will a mosquito survive raindrop collisions? How the bubbles under a ship reduce the drag force? In nature and industry\, flows with drops and bubbles exist everywhere. To understand these flows\, one of the powerful tools is the direct numerical simulation (DNS). Among all the DNS methods\, we choose the Phase Field (PF) method and develop some models based on it to simulate the complicated flows\, such as flows with moving contact lines\, fluid-structure interaction\, ternary fluids and turbulence. In this talk\, I will firstly introduce the advantages and disadvantages of PF method. Then\, I will show its applications: drop impact on an object\, compound droplet dynamics\, water entry of an object and multiphase turbulence. \n\nTime: 3:35-4:10 pm \nSpeaker:  Steven Chong \nTitle: Confined Rayleigh-Bénard\, rotating Rayleigh-Bénard\, double diffusive convection and quasi-static magnetoconvection: A unifying view on their scalar transport enhancement  \nAbstract: For Rayleigh-Bénard under geometrical confinement\, under rotation or the double diffusive convection with the second scalar component stabilizing the convective flow\, they seem to be the three different canonical models in turbulent flow. However\, previous research coincidentally reported the scalar transport enhancement in these systems. The results are counter-intuitive because the higher efficiency of scalar transport is bought about by the slower flow. In this talk\, I will show you a fundamental and unified perspective on such the global transport behavior observed in the seemingly different systems. We further show that the same view can be applied to the quasi-static magnetoconvection\, and indeed the regime with heat transport enhancement has been found. The beauty of physics is to understand the seemingly unrelated phenomena by a simplified concept. Here we provide a simplified and generic view\, and this concept could be potentially extended to other situations where the turbulent flow is subjected to an additional stabilization.\n\n\n11/27/2019\n\n\n\n\n12/4/2019\n\n\n\n\n12/11/2019\n\n\n\n\n\n  \nSee previous seminar information here.
URL:https://cmsa.fas.harvard.edu/event/fluid-dynamics-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200226T103000
DTEND;TZID=America/New_York:20200226T120000
DTSTAMP:20260502T070135
CREATED:20240212T081516Z
LAST-MODIFIED:20240212T081516Z
UID:10001885-1582713000-1582718400@cmsa.fas.harvard.edu
SUMMARY:02/26/2020 Quantum Matter/Quantum Field Theory Seminar
DESCRIPTION:
URL:https://cmsa.fas.harvard.edu/event/02-26-2020-quantum-matter-quantum-field-theory-seminar/
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200226T103000
DTEND;TZID=America/New_York:20200226T160000
DTSTAMP:20260502T070135
CREATED:20240201T021345Z
LAST-MODIFIED:20240201T021345Z
UID:10001520-1582713000-1582732800@cmsa.fas.harvard.edu
SUMMARY:Previous Random Matrix & Probability Theory Seminars
DESCRIPTION:Spring 2020:\n\n\n\n\nDate\nSpeaker\nTitle/Abstract\n\n\n2/26/2020\nLouigi Addario-Berry (McGill University)\nTitle: Hipster random walks and their ilk  \nAbstract: I will describe how certain recursive distributional equations can be solved by importing rigorous results on the convergence of approximation schemes for degenerate PDEs\, from numerical analysis. This project is joint work with Luc Devroye\, Hannah Cairns\, Celine Kerriou\, and Rivka Maclaine Mitchell.\n\n\n4/1/2020\nIan Jauslin (Princeton)\nThis meeting will be taking place virtually on Zoom. \nTitle: A simplified approach to interacting Bose gases\nAbstract: I will discuss some new results about an effective theory introduced by Lieb in 1963 to approximate the ground state energy of interacting Bosons at low density. In this regime\, it agrees with the predictions of Bogolyubov. At high densities\, Hartree theory provides a good approximation. In this talk\, I will show that the ’63 effective theory is actually exact at both low and high densities\, and numerically accurate to within a few percents in between\, thus providing a new approach to the quantum many body problem that bridges the gap between low and high density.\n\n\n4/22/2020\nMartin Gebert (UC Davis)\nThis meeting will be taking place virtually on Zoom. \nTitle: Lieb-Robinson bounds for a class of continuum many-body fermion systems \nAbstract: We introduce a class of UV-regularized two-body interactions for\nfermions in $\R^d$ and prove a Lieb-Robinson estimate for the dynamics\nof this class of many-body systems. As a step towards this result\, we\nalso prove a propagation bound of Lieb-Robinson type for continuum\none-particle Schr\“odinger operators. We apply the propagation bound to\nprove the existence of a strongly continuous infinite-volume dynamics on\nthe CAR algebra.\n\n\n4/29/2020\nMarcin Napiórkowski (University of Warsaw)\nThis meeting will be taking place virtually on Zoom. \nTitle: Free energy asymptotics of the quantum Heisenberg spin chain \nAbstract: Spin wave theory suggests that low temperature properties of the Heisenberg model can be described in terms of noninteracting quasiparticles called magnons. In my talk I will review the basic concepts and predictions of spin wave approximation and report on recent rigorous results in that direction. Based on joint work with Robert Seiringer.\n\n\n5/6/2020\nAntti Knowles (University of Geneva)\nTitle: Field theory as a limit of interacting quantum Bose gases\n\nAbstract: We prove that the grand canonical Gibbs state of an interacting quantum Bose gas converges to the Gibbs measure of a nonlinear Schrödinger equation in the mean-field limit\, where the density of the gas becomes large and the interaction strength is proportional to the inverse density. Our results hold in dimensions d = 1\,2\,3. For d > 1 the Gibbs measure is supported on distributions of negative regularity and we have to renormalize the interaction. The proof is based on a functional integral representation of the grand canonical Gibbs state\, in which convergence to the mean-field limit follows formally from an infinite-dimensional stationary phase argument for ill-defined non-Gaussian measures. We make this argument rigorous by introducing a white-noise-type auxiliary field\, through which the functional integral is expressed in terms of propagators of heat equations driven by time-dependent periodic random potentials. Joint work with Jürg Fröhlich\, Benjamin Schlein\, and Vedran Sohinger.\n\n\n5/13/2020\nSven Bachmann (University of British Columbia)\nTitle: Quantized quantum transport and Abelian anyons \nAbstract: I’ll discuss recent developments in the study of quantized quantum transport\, focussing on the quantum Hall effect. Beyond presenting an index taking rational values\, and which is the Hall conductance in the adapted setting\, I will explain how the index is intimately paired with the existence of quasi-particle excitations having non-trivial braiding properties.\n\n\n5/20/2020\nKristina Schubert (TU Dortmund)\nTitle: Fluctuation Results for General Ising Models — Block Spin Ising Models and Random Interactions \nAbstract: Starting from the classical Curie-Weiss model in statistical mechanics\, we will consider more general Ising models. On the one hand\, we introduce a block structure\, i.e. a model of spins in which the vertices are divided into a finite number of blocks and where pair interactions are given according to their blocks. The magnetization is then the vector of magnetizations within each block\, and we are interested in its behaviour and in particular in its fluctuations. On the other hand\, we consider Ising models on Erdős-Rényi random graphs. Here\, I will also present results on the fluctuations of the magnetization.\n\n\n\n\n  \nFall 2019:\n\n\n\nDate\nSpeaker\nTitle/Abstract\n\n\n9/11/2019\nSubhabrata Sen\nTitle: Sampling convergence for random graphs: graphexes and multigraphexes \nAbstract: We will look at structural properties of large\, sparse random graphs through the lens of sampling convergence (Borgs\, Chayes\, Cohn and Veitch ’17). Sam- pling convergence generalizes left convergence to sparse graphs\, and describes the limit in terms of a graphex. We will introduce this framework and motivate the components of a graphex. Subsequently\, we will discuss the graphex limit for several well-known sparse random (multi)graph models. This is based on joint work with Christian Borgs\, Jennifer Chayes\, and Souvik Dhara.\n\n\n9/25/2019\nJeff Schenker (Michigan State)\nTitle: An ergodic theorem for homogeneously distributed quantum channels with applications to matrix product states   \nAbstract: Quantum channels represent the most general physical evolution of a quantum system through unitary evolution and a measurement process. Mathematically\, a quantum channel is a completely positive and trace preserving linear map on the space of $D\times D$ matrices. We consider ergodic sequences of channels\, obtained by sampling channel valued maps along the trajectories of an ergodic dynamical system. The repeated composition of these maps along such a sequence could represent the result of repeated application of a given quantum channel subject to arbitrary correlated noise. It is physically natural to assume that such repeated compositions are eventually strictly positive\, since this is true whenever any amount of decoherence is present in the quantum evolution. Under such an hypothesis\, we obtain a general ergodic theorem showing that the composition of maps converges exponentially fast to a rank-one — “entanglement breaking’’ – channel. We apply this result to describe the thermodynamic limit of ergodic matrix product states and prove that correlations of observables in such states decay exponentially in the bulk. (Joint work with Ramis Movassagh)\n\n\n10/3/2019 \n  \nThursday \n4:30pm\nJian Ding (UPenn)\nTitle: Distances associated with Liouville quantum gravity \nAbstract: I will review some recent progresses on distances associated with Liouville quantum gravity\, which is a random measure obtained from exponentiating a planar Gaussian free field. \nThe talk is based on works with Julien Dubédat\, Alexander Dunlap\, Hugo Falconet\, Subhajit Goswami\, Ewain Gwynne\, Ofer Zeitouni and Fuxi Zhang in various combinations.\n\n\n10/9/2019\nRuth Williams (UCSD)\nTitle: Stability of a Fluid Model for Fair Bandwidth Sharing with General File Size Distributions \nAbstract: Massoulie and Roberts introduced a stochastic model for a data communication network where file sizes are generally distributed and the network operates under a fair bandwidth sharing policy. It has been a standing problem to prove stability of this general model when the average load on the system is less than the network’s capacity. A crucial step in an approach to this problem is to prove stability of an associated measure-valued fluid model. We shall describe prior work on this question done under various strong assumptions and indicate how to prove stability of the fluid model under mild conditions. \nThis talk is based on joint work with Yingjia Fu.\n\n\n10/11/2019\nCancelled\n\n\n\n10/16/2019\nWei-Kuo Chen (University of Minnesota)\nTitle: The generalized TAP free energy \nAbstract: Spin glasses are disordered spin systems initially invented by theoretical physicists with the aim of understanding some strange magnetic properties of certain alloys. In particular\, over the past decades\, the study of the Sherrington-Kirkpatrick (SK) mean-field model via the replica method has received great attention. In this talk\, I will discuss another approach to studying the SK model proposed by Thouless-Anderson-Palmer (TAP). I will explain how the generalized TAP correction appears naturally and give the corresponding generalized TAP representation for the free energy. Based on a joint work with D. Panchenko and E. Subag.\n\n\n10/23/2019\nSouvik Dhara (MIT)\nTitle: A new universality class for critical percolation on networks with heavy-tailed degrees \nAbstract: The talk concerns critical behavior of percolation on finite random networks with heavy-tailed degree distribution. In a seminal paper\, Aldous (1997) identified the scaling limit for the component sizes in the critical window of phase transition for the Erdős-Rényi random graph. Subsequently\, there has been a surge in the literature identifying two universality classes for the critical behavior depending on whether the asymptotic degree distribution has a finite or infinite third moment. \nIn this talk\, we will present a completely new universality class that arises in the context of degrees having infinite second moment. Specifically\, the scaling limit of the rescaled component sizes is different from the general description of multiplicative coalescent given by Aldous and Limic (1998). Moreover\, the study of critical behavior in this regime exhibits several surprising features that have never been observed in any other universality classes so far. \nThis is based on joint works with Shankar Bhamidi\, Remco van der Hofstad\, Johan van Leeuwaarden.\n\n\n10/30/2019\nAram Harrow (MIT)\nTitle: Random quantum circuits\, phase transitions and complexity \nAbstract: Random unitary dynamics are a toy model for chaotic quantum dynamics and also have applications to quantum information theory and computing. Recently\, random quantum circuits were the basis of Google’s announcement of “quantum computational supremacy\,” meaning performing a task on a programmable quantum computer that would difficult or infeasible for any classical computer. Google’s approach is based on the conjecture that random circuits are as hard to classical computers to simulate as a worst-case quantum computation would be. I will describe evidence in favor of this conjecture for deep random circuits and against this conjecture for shallow random circuits. (Deep/shallow refers to the number of time steps of the quantum circuit.) For deep random circuits in Euclidean geometries\, we show that quantum dynamics match the first few moments of the Haar measure after roughly the amount of time needed for a signal to propagate from one side of the system to the other. In non-Euclidean geometries\, such as the Schwarzschild metric in the vicinity of a black hole\, this turns out not to be always true. I will also explain how shallow quantum circuits are easier to simulate when the gates are randomly chosen than in the worst case. This uses a simulation algorithm based on tensor contraction which is analyzed in terms of an associated stat mech model. \nThis is based on joint work with Saeed Mehraban (1809.06957) and with John Napp\, Rolando La Placa\, Alex Dalzell and Fernando Brandao (to appear).\n\n\n11/6/2019\nBruno Nachtergaele (UC Davis)\nTitle: The transmission time and local integrals of motion for disordered spin chains \nAbstract:  We investigate the relationship between zero-velocity Lieb-Robinson bounds and the existence of local integrals of motion (LIOMs) for disordered quantum spin chains. We also study the effect of dilute random perturbations on the dynamics of many-body localized spin chains. Using a notion of transmission time for propagation in quantum lattice systems we demonstrate slow propagation by proving a lower bound for the transmission time. This result can be interpreted as a robustness property of slow transport in one dimension. (Joint work with Jake Reschke)\n\n\n11/13/2019\nGourab Ray (University of Victoria)\nTitle: Logarithmic variance of height function of square-iceAbstract: A homomorphism height function on a finite graph is a integer-valued function on the set of vertices constrained to have adjacent vertices take adjacent integer values. We consider the uniform distribution over all such functions defined on a finite subgraph of Z^2 with predetermined values at some fixed boundary vertices. This model is equivalent to the height function of the six-vertex model with a = b = c = 1\, i.e. to the height function of square-ice. Our main result is that in a subgraph of Z^2 with zero boundary conditions\, the variance grows logarithmically in the distance to the boundary. This establishes a strong form of roughness of the planar uniform homomorphisms. \n  \nJoint work with: Hugo Duminil Copin\, Matan Harel\, Benoit Laslier and Aran Raoufi.\n\n\n11/20/2019\nVishesh Jain (MIT)\nTitle: A combinatorial approach to the quantitative invertibility of random matrices. \n  \nAbstract: Abstract: Let $s_n(M_n)$ denote the smallest singular value of an $n\times n$ random matrix $M_n$. We will discuss a novel combinatorial approach (in particular\, not using either inverse Littlewood–Offord theory or net arguments) for obtaining upper bounds on the probability that $s_n(M_n)$ is smaller than $\eta \geq 0$ for quite general random matrix models. Such estimates are a fundamental part of the non-asymptotic theory of random matrices and have applications to the strong circular law\, numerical linear algebra etc. In several cases of interest\, our approach provides stronger bounds than those obtained by Tao and Vu using inverse Littlewood–Offord theory.\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n  \n  \n  \n2018-2019\n\n\n\nDate\nSpeaker\nTitle/Abstract\n\n\n9/28/2018 \n*Friday\, 10:00am*\nYash Deshpande (MIT)\nTitle: Estimating low-rank matrices in noise: phase transitions from spin glass theory \nAbstract: Estimating low-rank matrices from noisy observations is a common task in statistical and engineering applications. Following the seminal work of Johnstone\, Baik\, Ben-Arous and Peche\, versions of this problem have been extensively studied using random matrix theory. In this talk\, we will consider an alternative viewpoint based on tools from mean field spin glasses. We will present two examples that illustrate how these tools yield information beyond those from classical random matrix theory. The first example is the two-groups stochastic block model (SBM)\, where we will obtain a full information-theoretic understanding of the estimation phase transition. In the second example\, we will augment the SBM with covariate information at nodes\, and obtain results on the altered phase transition. \nThis is based on joint works with Emmanuel Abbe\, Andrea Montanari\, Elchanan Mossel and Subhabrata Sen.\n\n\n10/3/2018\nIan Jauslin (IAS)\nTitle: Liquid Crystals and the Heilmann-Lieb model \nAbstract: In 1979\, O.Heilmann and E.H. Lieb introduced an interacting dimer model with the goal of proving the emergence of a nematic liquid crystal phase in it. In such a phase\, dimers spontaneously align\, but there is no long range translational order. Heilmann and Lieb proved that dimers do\, indeed\, align\, and conjectured that there is no translational order. I will discuss a recent proof of this conjecture. This is joint work with Elliott H. Lieb.\n\n\n10/10/2018\nAfonso Bandeira (NYU\nTitle: Statistical estimation under group actions: The Sample Complexity of Multi-Reference Alignment \nAbstract: Many problems in signal/image processing\, and computer vision amount to estimating a signal\, image\, or tri-dimensional structure/scene from corrupted measurements. A particularly challenging form of measurement corruption are latent transformations of the underlying signal to be recovered. Many such transformations can be described as a group acting on the object to be recovered. Examples include the Simulatenous Localization and Mapping (SLaM) problem in Robotics and Computer Vision\, where pictures of a scene are obtained from different positions and orientations; Cryo-Electron Microscopy (Cryo-EM) imaging where projections of a molecule density are taken from unknown rotations\, and several others. \nOne fundamental example of this type of problems is Multi-Reference Alignment: Given a group acting in a space\, the goal is to estimate an orbit of the group action from noisy samples. For example\, in one of its simplest forms\, one is tasked with estimating a signal from noisy cyclically shifted copies. We will show that the number of observations needed by any method has a surprising dependency on the signal-to-noise ratio (SNR)\, and algebraic properties of the underlying group action. Remarkably\, in some important cases\, this sample complexity is achieved with computationally efficient methods based on computing invariants under the group of transformations.\n\n\n10/17/2018 \n3:30pm\nThomas Chen (UT Austin)\nTitle: Dynamics of a heavy quantum tracer particle in a Bose gas \nAbstract: We consider the dynamics of a heavy quantum tracer particle coupled to a non-relativistic boson field in R^3. The pair interactions of the bosons are of mean-field type\, with coupling strength proportional to 1/N where N is the expected particle number. Assuming that the mass of the tracer particle is proportional to N\, we derive generalized Hartree equations in the limit where N tends to infinity. Moreover\, we prove the global well-posedness of the associated Cauchy problem for sufficiently weak interaction potentials. This is joint work with Avy Soffer (Rutgers University).\n\n\n10/24/2018 \n*Room G02*\nTselil Schramm (Harvard/MIT)\nTitle: (Nearly) Efficient Algorithms for the Graph Matching Problem in Correlated Random Graphs \nAbstract: The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-necessarily-isomorphic graphs\, the goal is to find a permutation of the vertices which maximizes the number of common edges. We study a popular average-case variant; we deviate from the common heuristic strategy and give the first quasi-polynomial time algorithm\, where previously only sub-exponential time algorithms were known. \nBased on joint work with Boaz Barak\, Chi-Ning Chou\, Zhixian Lei\, and Yueqi Sheng.\n\n\n10/30/2018 \n*Tuesday \n10:30am \nSC 507*\nLauren Williams (Harvard)\nTitle: Introduction to the asymmetric simple exclusion process (from a combinatorialist’s point of view) \nAbstract: The asymmetric simple exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice\, subject to the condition that there is at most one particle per site. This model was introduced in 1970 by biologists (as a model for translation in protein synthesis) but has since been shown to display a rich mathematical structure. There are many variants of the model — e.g. the lattice could be a ring\, or a line with open boundaries. One can also allow multiple species of particles with different “weights.” I will explain how one can give combinatorial formulas for the stationary distribution using various kinds of tableaux. I will also explain how the ASEP is related to interesting families of orthogonal polynomials\, including Askey-Wilson polynomials\, Koornwinder polynomials\, and Macdonald polynomials.\n\n\n11/7/2018\nWillhelm Schlag (Yale)\nTitle: on the Bourgain-Dyatlov fractal uncertainty principle \nAbstract: We will present the Bourgain-Dyatlov theorem on the line\, it’s connection with other uncertainty principles in harmonic analysis\, and my recent partial progress with Rui Han on the problem of higher dimensions.\n\n\n11/14/2018\nDavid Gamarnik (MIT)\nTitle: Two Algorithmic Hardness Results in Spin Glasses and Compressive Sensing. \nAbstract: I will discuss two computational problems in the area of random combinatorial structures. The first one is the problem of computing the partition function of a Sherrington-Kirkpatrick spin glass model. While the the problem of computing the partition functions associated with arbitrary instances is known to belong to the #P complexity class\, the complexity of the problem for random instances is open. We show that the problem of computing the partition function exactly (in an appropriate sense) for the case of instances involving Gaussian couplings is #P-hard on average. The proof uses Lipton’s trick of computation modulo large prime number\, reduction of the average case to the worst case instances\, and the near uniformity of the ”stretched” log-normal distribution. \nIn the second part we will discuss the problem of explicit construction of matrices satisfying the Restricted Isometry Property (RIP). This challenge arises in the field of compressive sensing. While random matrices are known to satisfy the RIP with high probability\, the problem of explicit (deterministic) construction of RIP matrices eluded efforts and hits the so-called ”square root” barrier which I will discuss in the talk. Overcoming this barrier is an open problem explored widely in the literature. We essentially resolve this problem by showing that an explicit construction of RIP matrices implies an explicit construction of graphs satisfying a very strong form of Ramsey property\, which has been open since the seminal work of Erdos in 1947.\n\n\n11/28/2018\nSean O’ Rourke (UC Boulder)\nTitle: Universality and least singular values of random matrix products \nAbstract: We consider the product of m independent iid random matrices as m is fixed and the sizes of the matrices tend to infinity.  In the case when the factor matrices are drawn from the complex Ginibre ensemble\, Akemann and Burda computed the limiting microscopic correlation functions.  In particular\, away from the origin\, they showed that the limiting correlation functions do not depend on m\, the number of factor matrices. We show that this behavior is universal for products of iid random matrices under a moment matching hypothesis.  In addition\, we establish universality results for the linear statistics for these product models\, which show that the limiting variance does not depend on the number of factor matrices either. The proofs of these universality results require a near-optimal lower bound on the least singular value for these product ensembles.\n\n\n12/5/2018 \n*Room G02*\nOmer Angel (UBC)\nTitle: balanced excited random walks \nAbstract: I will present results on the scaling limit and asymptotics of the balanced excited random walk and related processes. This is a walk the that moves vertically on the first visit to a vertex\, and horizontally on every subsequent visit. We also analyze certain versions of “clairvoyant scheduling” of random walks. \nJoint work with Mark Holmes and Alejandro Ramirez.\n\n\n2/7/2019 \nScience Center 530\nRamis Movassagh (IMB Research)\nTitle: Generic Gaplessness\, and Hamiltonian density of states from free probability theory \nAbstract: Quantum many-body systems usually reside in their lowest energy states. This among other things\, motives understanding the gap\, which is generally an undecidable problem. Nevertheless\, we prove that generically local quantum Hamiltonians are gapless in any dimension and on any graph with bounded maximum degree. \nWe then provide an applied and approximate answer to an old problem in pure mathematics. Suppose the eigenvalue distributions of two matrices M_1 and M_2 are known. What is the eigenvalue distribution of the sum M_1+M_2? This problem has a rich pure mathematics history dating back to H. Weyl (1912) with many applications in various fields. Free probability theory (FPT) answers this question under certain conditions. We will describe FPT and show examples of its powers for approximating physical quantities such as the density of states of the Anderson model\, quantum spin chains\, and gapped vs. gapless phases of some Floquet systems. These physical quantities are often hard to compute exactly (provably NP-hard). Nevertheless\, using FPT and other ideas from random matrix theory excellent approximations can be obtained. Besides the applications presented\, we believe the techniques will find new applications in fresh new contexts.\n\n\n2/14/2019\nNike Sun (MIT)\nTitle: Capacity lower bound for the Ising perceptron \nAbstract: The perceptron is a toy model of a simple neural network that stores a collection of given patterns. Its analysis reduces to a simple problem in high-dimensional geometry\, namely\, understanding the intersection of the cube (or sphere) with a collection of random half-spaces. Despite the simplicity of this model\, its high-dimensional asymptotics are not well understood. I will describe what is known and present recent results.\n\n\n2/21/2019\nMichael Loss (Georgia Tech)\nTitle: Some results for functionals of Aharonov-Bohm type \nAbstract: In this talk I present some variational problems of Aharonov-Bohm type\, i.e.\, they include a  magnetic flux that is entirely concentrated at a point. This is maybe the simplest example of a  variational problems for systems\, the wave function being necessarily complex. The functional is rotationally invariant and the issue to be discussed is whether the optimizer have this symmetry or whether it is broken.\n\n\n3/6/2019 \n4:15pm \nScience Center 411\nIlya Kachkovskiy (Michigan State University)\nTitle: Localization and delocalization for interacting 1D quasiperiodic particles. \nAbstract: We consider a system of two interacting one-dimensional quasiperiodic particles as an operator on $\ell^2(\mathbb Z^2)$. The fact that particle frequencies are identical\, implies a new effect compared to generic 2D potentials: the presence of large coupling localization depends on symmetries of the single-particle potential. If the potential has no cosine-type symmetries\, then we are able to show large coupling localization at all energies\, even if the interaction is not small (with some assumptions on its complexity). If symmetries are present\, we can show localization away from finitely many energies\, thus removing a fraction of spectrum from consideration. We also demonstrate that\, in the symmetric case\, delocalization can indeed happen if the interaction is strong\, at the energies away from the bulk spectrum. The result is based on joint works with Jean Bourgain and Svetlana Jitomirskaya.\n\n\n3/14/2019 \n5:45pm \nScience Center 232\nAnna Vershynina (University of Houston)\nTitle: How fast can entanglement be generated in quantum systems? \nAbstract: We investigate the maximal rate at which entanglement can be generated in bipartite quantum systems. The goal is to upper bound this rate. All previous results in closed systems considered entanglement entropy as a measure of entanglement. I will present recent results\, where entanglement measure can be chosen from a large class of measures. The result is derived from a general bound on the trace-norm of a commutator\, and can\, for example\, be applied to bound the entanglement rate for Renyi and Tsallis entanglement entropies.\n\n\n3/28/2019 \nRoom G02\nXuwen Chen (University of Rochester)\nTitle: The Derivation of the Energy-critical NLS from Quantum Many-body Dynamics \nAbstract: We derive the 3D energy-critical quintic NLS from quantum many-body dynamics with 3-body interaction in the T^3 (periodic) setting. Due to the known complexity of the energy critical setting\, previous progress was limited in comparison to the 2-body interaction case yielding energy subcritical cubic NLS. We develop methods to prove the convergence of the BBGKY hierarchy to the infinite Gross-Pitaevskii (GP) hierarchy\, and separately\, the uniqueness of large GP solutions. Since the trace estimate used in the previous proofs of convergence is the false sharp trace estimate in our setting\, we instead introduce a new frequency interaction analysis and apply the finite dimensional quantum de Finetti theorem. For the large solution uniqueness argument\, we discover the new HUFL (hierarchical uniform frequency localization) property for the GP hierarchy and use it to prove a new type of uniqueness theorem.\n\n\n4/4/2019\nPaul Bourgade (NYU)\nTitle: Log-correlations and branching structures in analytic number theory \nAbstract: Fyodorov\, Hiary and Keating have predicted the size of local maxima of L-function along the critical axis\, based on analogous random matrix statistics. I will explain this prediction in the context of the log-correlated universality class and branching structures. In particular I will explain why the Riemann zeta function exhibits log-correlations\, and outline the proof for the leading order of the maximum in the Fyodorov\, Hiary and Keating prediction. Joint work with Arguin\, Belius\, Radziwill and Soundararajan.\n\n\n4/9/2019 \nTuesday \n12:00pm \nRoom G02\nGiulio Biroli (ENS Paris)\nTitle: Large deviations for the largest eigenvalues and eigenvectors of spiked random matrices \nAbstract: I consider matrices formed by a random $N\times N$ matrix drawn from the Gaussian Orthogonal Ensemble (or Gaussian Unitary Ensemble) plus a rank-one perturbation of strength $\theta$\, and focus on the largest eigenvalue\, $x$\, and the component\, $u$\, of the corresponding eigenvector in the direction associated to the rank-one perturbation. I will show how to obtain the large deviation principle governing the atypical joint fluctuations of $x$ and $u$. Interestingly\, for $\theta>1$\, in large deviations characterized by a small value of $u$\, i.e. $u<1-1/\theta$\, the second-largest eigenvalue pops out from the Wigner semi-circle and the associated eigenvector orients in the direction corresponding to the rank-one perturbation. These results can be generalized to the Wishart Ensemble\, and extended to the first $n$ eigenvalues and the associated eigenvectors. \nFinally\, I will discuss motivations and applications of these results to the study of the geometric properties of random high-dimensional functions—a topic that is currently attracting a lot of attention in physics and computer science.\n\n\n4/11/2019\nRui Han (Georgia Tech)\nTitle: Spectral gaps in graphene structures \nAbstract: We present a full analysis of the spectrum of graphene in magnetic fields with constant flux through every hexagonal comb. In particular\, we provide a rigorous foundation for self-similarity by showing that for irrational flux\, the spectrum of graphene is a zero measure Cantor set. We also show that for vanishing flux\, the spectral bands have nontrivial overlap\, which proves the discrete Bethe-Sommerfeld conjecture for the graphene structure. This is based on joint works with S. Becker\, J. Fillman and S. Jitomirskaya.\n\n\n4/25/2019\nBenjamin Fehrman (Oxford)\nTitle:  Pathwise well-posedness of nonlinear diffusion equations with nonlinear\, conservative noise \nAbstract:  We present a pathwise well-posedness theory for stochastic porous media and fast diffusion equations driven by nonlinear\, conservative noise.  Such equations arise in the theory of mean field games\, approximate the Dean-Kawasaki equation in fluctuating fluid dynamics\, describe the fluctuating hydrodynamics of the zero range process\, and model the evolution of a thin film in the regime of negligible surface tension.  Motivated by the theory of stochastic viscosity solutions\, we pass to the equation’s kinetic formulation\, where the noise enters linearly and can be inverted using the theory of rough paths. The talk is based on joint work with Benjamin Gess.\n\n\n4/30/2019\nTBA\nTBA\n\n\n5/2/2019\nJian Ding (UPenn)\nTBA\n\n\n\n2017-2018\n\n\n\nDate…………\nName…………….\nTitle/Abstract\n\n\n2-16-20183:30pm \nG02\nReza Gheissari (NYU)\nDynamics of Critical 2D Potts ModelsAbstract: The Potts model is a generalization of the Ising model to $q\geq 3$ states with inverse temperature $\beta$. The Gibbs measure on $\mathbb Z^2$ has a sharp transition between a disordered regime when $\beta<\beta_c(q)$ and an ordered regime when $\beta>\beta_c(q)$. At $\beta=\beta_c(q)$\, when $q\leq 4$\, the phase transition is continuous while when $q>4$\, the phase transition is discontinuous and the disordered and ordered phases coexist. \nWe will discuss recent progress\, joint with E. Lubetzky\, in analyzing the time to equilibrium (mixing time) of natural Markov chains (e.g.\, heat bath/Metropolis) for the 2D Potts model\, where the mixing time on an $n \times n$ torus should transition from $O(\log n)$ at high temperatures to $\exp(c_\beta n)$ at low temperatures\, via a critical slowdown at $\beta_c(q)$ that is polynomial in $n$ when $q \leq 4$ and exponential in $n$ when $q>4$.\n\n\n2-23-20183:30pm \nG02\nMustazee Rahman (MIT)\nOn shocks in the TASEPAbstract: The TASEP particle system runs into traffic jams when the particle density to the left is smaller than the density to the right. Macroscopically\, the particle density solves Burgers’ equation and traffic jams correspond to its shocks. I will describe work with Jeremy Quastel on a specialization of the TASEP shock whereby we identify the microscopic fluctuations around the shock by using exact formulas for the correlation functions of TASEP and its KPZ scaling limit. The resulting laws are related to universal laws of random matrix theory. \nFor the curious\, here is a video of the shock forming in Burgers’ equation: \n\n\n\n4-20-20182:00-3:00pm\nCarlo Lucibello(Microsoft Research NE)\nThe Random Perceptron Problem: thresholds\, phase transitions\, and geometryAbstract: The perceptron is the simplest feedforward neural network model\, the building block of the deep architectures used in modern machine learning practice. In this talk\, I will review some old and new results\, mostly focusing on the case of binary weights and random examples. Despite its simplicity\, this model provides an extremely rich phenomenology: as the number of examples per synapses is increased\, the system undergoes different phase transitions\, which can be directly linked to solvers’ performances and to information theoretic bounds. A geometrical analysis of the solution space shows how two different types of solutions\, akin to wide and sharp minima\, have different generalization capabilities when presented with new examples.  Solutions in dense clusters generalize remarkably better\,  partially closing the gap with Bayesian optimal estimators.  Most of the results I will present were first obtained using non rigorous techniques from spin glass theory and many of them haven’t been rigorously established yet\,  although some big steps forward have been taken in recent years.\n\n\n4-20-20183:00-4:00pm\nYash Despande(MIT)\nPhase transitions in estimating low-rank matricesAbstract: Low-rank perturbations of Wigner matrices have been extensively studied in random matrix theory; much information about the corresponding spectral phase transition can be gleaned using these tools. In this talk\, I will consider an alternative viewpoint based on tools from spin glass theory\, and two examples that illustrate how these they yield information beyond traditional spectral tools. The first example is the stochastic block model\,where we obtain a full information-theoretic picture of estimation. The second example demonstrates how side information alters the spectral threshold. It involves a new phase transition that interpolates between the Wigner and Wishart ensembles.\n\n\n\n\n\n\nDate\nName\nTitle/Abstract\n\n\n9-27-17\nHerbert Spohn\, Technische Universität München\nHydrodynamics of integrable classical and quantum systems \nAbstract:  In the cold atoms community there is great interest in developing Euler-type hydrodynamics for one-dimensional integrable quantum systems\, in particular with application to domain wall initial states.  I provide some mathematical physics background and also compare with integrable classical systems.\n\n\n10-23-17 \n*12:00-1:00pm\, Science Center 232*\n Madhu Sudan\, Harvard SEAS\nGeneral Strong Polarization \nA recent discovery (circa 2008) in information theory called Polar Coding has led to a remarkable construction of error-correcting codes and decoding algorithms\, resolving one of the fundamental algorithmic challenges in the field. The underlying phenomenon studies the “polarization” of a “bounded” martingale. A bounded martingale\, X_0\,…\,X_t\,…  is one where X_t in [0\,1]. This martingale is said to polarize if Pr[lim_{t\to infty} X_t \in {0\,1}] = 1. The questions of interest to the results in coding are the rate of convergence and proximity: Specifically\, given epsilon and tau > 0 what is the smallest t after which it is the case that Pr[X_t in (tau\,1-tau)] < epsilon? For the main theorem\, it was crucial that t <= min{O(log(1/epsilon))\, o(log(1/tau))}. We say that a martingale polarizes strongly if it satisfies this requirement. We give a simple local criterion on the evolution of the martingale that suffices for strong polarization. A consequence to coding theory is that a broad class of constructions of polar codes can be used to resolve the afore-mentioned algorithmic challenge. \nIn this talk I will introduce the concepts of polarization and strong polarization.  Depending on the audience interest I can explain why this concept is useful to construct codes and decoding algorithms\, or explain the local criteria that help establish strong polarization (and the proof of why it does so). \nBased on joint work with Jaroslaw Blasiok\, Venkatesan Guruswami\, Preetum Nakkiran\, and Atri Rudra.\n\n\n10-25-17 \n*2:00-4:00pm*\nSubhabrata Sen (Microsoft and MIT) \nNoga Alon\,(Tel Aviv University)\nSubhabrata Sen\, “Partitioning sparse random graphs: connections with mean-field spin glasses” \nAbstract: The study of graph-partition problems such as Maxcut\, max-bisection and min-bisection have a long and rich history in combinatorics and theoretical computer science. A recent line of work studies these problems on sparse random graphs\, via a connection with mean field spin glasses. In this talk\, we will look at this general direction\, and derive sharp comparison inequalities between cut-sizes on sparse Erd\ ̋{o}s-R\'{e}nyi and random regular graphs. \nBased on joint work with Aukosh Jagannath. \nNoga Alon\, “Random Cayley Graphs” \nAbstract: The study of random Cayley graphs of finite groups is related to the  investigation of Expanders and to problems in Combinatorial Number Theory and in Information Theory. I will discuss this topic\, describing the motivation and focusing on the question of estimating the chromatic number of a random Cayley graph of a given  group with a prescribed number of generators.  Several intriguing questions that remain open will be mentioned as well.\n\n\n11-1-17 \n*2:00-4:00pm*\nKay Kirkpatrick (Illinois) \nand \nWei-Ming Wang (CNRS)\nKay Kirkpatrick\, Quantum groups\, Free Araki-Woods Factors\, and a Calculus for Moments \n Abstract: We will discuss a central limit theorem for quantum groups: that the joint distributions with respect to the Haar state of the generators of free orthogonal quantum groups converge to free families of generalized circular elements in the large (quantum) dimension limit. We also discuss a connection to free Araki-Woods factors\, and cases where we have surprisingly good rates of convergence. This is joint work with Michael Brannan. Time permitting\, we’ll mention another quantum central limit theorem for Bose-Einstein condensation and work in progress. \nWei-Min Wang\, Quasi-periodic solutions to nonlinear PDE’s \nAbstract: We present a new approach to the existence of time quasi-periodic solutions to nonlinear PDE’s. It is based on the method of Anderson localization\, harmonic analysis and algebraic analysis. This can be viewed as an infinite dimensional analogue of a Lagrangian approach to KAM theory\, as suggested by J. Moser.\n\n\n11-8-17\nElchanan Mossel\nOptimal Gaussian Partitions. \nAbstract: How should we partition the Gaussian space into k parts in a way that minimizes Gaussian surface area\, maximize correlation or simulate a specific distribution. \nThe problem of Gaussian partitions was studied since the 70s first as a generalization of the isoperimetric problem in the context of the heat equation. It found a renewed interest in context of the double bubble theorem proven in geometric measure theory and due to connection to problems in theoretical computer science and social choice theory. \nI will survey the little we know about this problem and the major open problems in the area.\n\n\n11-10-17 \n*12pm SC 232*\nZhe Wang (NYU)\nA Driven Tagged Particle in One-dimensional Simple Exclusion Process \nAbstract: We study the long-time behavior of a driven tagged particle in a one-dimensional non-nearest- neighbor simple exclusion process.  We will discuss two scenarios when the tagged particle has a speed. Particularly\, for the ASEP\, the tagged particle can have a positive speed even when it has a drift with negative mean; for the SSEP with removals\, we can compute the speed explicitly. We will characterize some nontrivial invariant measures of the environment process by using coupling arguments and color schemes.\n\n\n11-15-17 \n*4:00-5:00pm* \n*G02*\nDaniel Sussman (BU)\nMultiple Network Inference: From Joint Embeddings to Graph Matching \nAbstract: Statistical theory\, computational methods\, and empirical evidence abound for the study of individual networks. However\, extending these ideas to the multiple-network framework remains a relatively under-explored area. Individuals today interact with each other through numerous modalities including online social networks\, telecommunications\, face-to-face interactions\, financial transactions\, and the sharing and distribution of goods and services. Individually these networks may hide important activities that are only revealed when the networks are studied jointly. In this talk\, we’ll explore statistical and computational methods to study multiple networks\, including a tool to borrow strength across networks via joint embeddings and a tool to confront the challenges of entity resolution across networks via graph matching.\n\n\n11-20-17 \n*Monday \n12:00-1:00pm*\n Yue M. Lu \n(Harvard)\n\n\n\n\n\n\n\nAsymptotic Methods for High-Dimensional Inference: Precise Analysis\, Fundamental Limits\, and Optimal Designs\n\nAbstract: Extracting meaningful information from the large datasets being compiled by our society presents challenges and opportunities to signal and information processing research. On the one hand\, many classical methods\, and the assumptions they are based on\, are simply not designed to handle the explosive growth of the dimensionality of the modern datasets. On the other hand\, the increasing dimensionality offers many benefits: in particular\, the very high-dimensional settings allow one to apply powerful asymptotic methods from probability theory and statistical physics to obtain precise characterizations that would otherwise be too complicated in moderate dimensions. I will mention recent work on exploiting such blessings of dimensionality via sharp asymptotic methods. In particular\, I will show (1) the exact characterization of a widely-used spectral method for nonconvex signal recoveries; (2) the fundamental limits of solving the phase retrieval problem via linear programming; and (3) how to use scaling and mean-field limits to analyze nonconvex optimization algorithms for high-dimensional inference and learning. In these problems\, asymptotic methods not only clarify some of the fascinating phenomena that emerge with high-dimensional data\, they also lead to optimal designs that significantly outperform commonly used heuristic choices.\n\n\n\n\n\n\n\n\n\n11-29-17\nDavid Gamarink (MIT)\n(Arguably) Hard on Average Constraint Satisfaction Problems \nAbstract: Many combinatorial optimization problems defined on random instances such as random graphs\, exhibit an apparent gap between the optimal value\, which can be estimated by non-constructive means\, and the best values achievable by fast (polynomial time) algorithms. Through a combined effort of mathematicians\, computer scientists and statistical physicists\, it became apparent that a potential and in some cases a provable obstruction for designing algorithms bridging this gap is an intricate geometry of nearly optimal solutions\, in particular the presence of chaos and a certain Overlap Gap Property (OGP)\, which we will introduce in this talk. We will demonstrate how for many such problems\, the onset of the OGP phase transition indeed nearly coincides with algorithmically hard regimes. Our examples will include the problem of finding a largest independent set of a graph\, finding a largest cut in a random hypergrah\, random NAE-K-SAT problem\, the problem of finding a largest submatrix of a random matrix\, and a high-dimensional sparse linear regression problem in statistics. \nJoint work with Wei-Kuo Chen\, Quan Li\, Dmitry Panchenko\,  Mustazee Rahman\, Madhu Sudan and Ilias Zadik.\n\n\n12-6-17 \n*2:00-4:00pm*\nPhilippe Rigollet (MIT) \n2-3 pm \n& \nAnkur Moitra (MIT) \n3-4 pm\nPhilippe Rigollet (MIT)\, Exact Recovery in the Ising Block Model  \nAbstract: Over the past fifteen years\, the problem of learning Ising models from independent samples has been of significant interest in the statistics\, machine learning\, and statistical physics communities. Much of the effort has been directed towards finding algorithms with low computational cost for various restricted classes of models\, primarily in the case where the interaction graph is sparse. In parallel\, stochastic blockmodels have played a more and more preponderant role in community detection and clustering as an average case model for the minimum bisection model. In this talk\, we introduce a new model\, called Ising blockmodel for the community structure in an Ising model. It imposes a block structure on the interactions of a dense Ising model and can be viewed as a structured perturbation of the celebrated Curie-Weiss model. We show that interesting phase transitions arise in this model and leverage this probabilistic analysis to develop an algorithm based on semidefinite programming that recovers exactly the community structure when the sample size is large enough. We also prove that exact recovery of the block structure is actually impossible with fewer samples. \nThis is joint work with Quentin Berthet (University of Cambridge) and Piyush Srivastava (Tata Institute). \nAnkur Moitra (MIT)\, A New Approach to Approximate Counting and Sampling  \nAbstract: Over the past sixty years\, many remarkable connections have been made between statistical physics\, probability\, analysis and theoretical computer science through the study of approximate counting. While tight phase transitions are known for many problems with pairwise constraints\, much less is known about problems with higher-order constraints.\nHere we introduce a new approach for approximately counting and sampling in bounded degree systems. Our main result is an algorithm to approximately count the number of solutions to a CNF formula where the degree is exponential in the number of variables per clause. Our algorithm extends straightforwardly to approximate sampling\, which shows that under Lovasz Local Lemma-like conditions\, it is possible to generate a satisfying assignment approximately uniformly at random. In our setting\, the solution space is not even connected and we introduce alternatives to the usual Markov chain paradigm. \n\n\n\n\n12-14-17\nTBD\n\n\n\n\n\n\n\n\n\n\n\n\nDate\nName\nTitle\n\n\n09-16-2015\nScott Aaronson\, MIT\nBosonSampling and the Permanents of Gaussian Matrices\n\n\n09-23-2015\nXin Sun\, MIT\nAlmost sure multi fractal spectrum of SLE\n\n\n09-28-2015\nLi-Cheng Tsai\, Stanford\nKPZ equation limit of interacting particle systems\n\n\n09-30-2015\nKyle Luh\, Yale\nRandom Matrices: l1 Concentration and Dictionary Learning with Few Samples\n\n\n10-07-2015\nMartin Zirnbauer\, Cologne/Simons Center\nBott periodicity and the “Periodic Table” of topological insulators and superconductors\n\n\n10-14-2015\nBenjamin Schweinhart\, Harvard CMSA\nUniversality Conjectures for Curvature Flow on Graphs\n\n\n10-21-2015\nNicholas Cook\, UCLA\n\n\nRandom regular digraphs: singularity and spectrum \n\n\n\n\n10-28-2015\nVu-Lan Nguyen\, Université Paris Diderot\nVariants of geometric RSK\, geometric PNG and the multipoint distribution of the log-gamma polymer\n\n\n11-04-2015\nVadim Gorin\, MIT\nLargest eigenvalues in random matrix beta-ensembles: structures of the limit.\n\n\n11-18-2015\nLouis-Pierre Arguin\, CUNY\nThe maximum of the characteristic polynomial of random unitary matrices \n\n\n11-19-2015\nNicholas Zygouras\, Univ. of Warwick\nFrom disorder relevance to the 2d Stochastic Heat Equation\n\n\n11-25-2015\nThanksgiving\nNo seminar\n\n\n12-02-2015\nEero Saksman (Helsinki)\nThe uniqueness of Gaussian multiplicative chaos revisited\n\n\n12-04-2015\nGuillaume Barraquand\, Columbia\nRandom walks in Beta random environment\n\n\n01-27-2016\nLouigi Addario-Berry\, McGill\nSlowdown of the front for branching Brownian motion with decay of mass\n\n\n02-03-2016\nAntti Knowles\, ETH Zurich\nAn optimal rotational invariant estimator for general covariance matrices\n\n\n02-10-2016\nNo Seminar this week\n\n\n\n02-17-2016\nFlorent Bekerman\, MIT\nTransport Methods and Universality for beta-matrix models\n\n\n02-24-2016\nAukosh Jagannath\, Courant Institute\nThe Parisi variational problem\n\n\n03-02-2016\nNo Seminar this week\nTwo next week\n\n\n03-09-2016\nAdam Marcus\, Princeton\nPolynomials and (finite) free probability\n\n\n03-11-2016\nHao Shen\, Columbia\nThe Sine-Gordon stochastic PDE and regularity structures\n\n\n03-16-2016\nSpring Recess\n\n\n\n03-23-2016\nZeev Rudnick\, Tel-Aviv and IAS\nQuantum chaos\, eigenvalue statistics and the Fibonacci sequence\n\n\n03-30-2016\nNikolai Makarov\, Caltech\nRandom normal matrices with hard edge spectrum\n\n\n04-06-2016\nTimo Seppalainen\, Wisconsin\nVariational formulas and Busemann functions for random paths in a random medium\n\n\n04-11-2016 (Science Center 530)\nMilton D. Jara\, IMPA\nAround the strong KPZ universality conjecture\n\n\n04-20-2016\nMark Rudelson\, Michigan\nDelocalization of eigenvectors of random matrices\n\n\n04-27-2016\nMarek Biskup\, UCLA\nLocal limit theory for extreme values of 2D Discrete Gaussian Free Field\n\n\n05-04-2016\nNo Talk\n\n\n\n05-11-2016 (2:30-3:30pm\, Room G10)\nLaure Saint-Raymond\, École Normale Supérieure\nFluctuating dynamics for a 2D rarified gas of hard disks\n\n\n06-01-2016\nJun Yin\, University of Wisconsin\nGeneralized Circular Law\n\n\n06-08-2016\nPaul Bourgade\, NYU\nExtremes of random matrices and log-correlated fields
URL:https://cmsa.fas.harvard.edu/event/previous-random-matrix-probability-theory-seminars/
CATEGORIES:Random Matrix & Probability Theory Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200228T164500
DTEND;TZID=America/New_York:20200228T174500
DTSTAMP:20260502T070135
CREATED:20240212T082705Z
LAST-MODIFIED:20240507T203156Z
UID:10001889-1582908300-1582911900@cmsa.fas.harvard.edu
SUMMARY:Derandomizing Algorithms via Spectral Graph Theory
DESCRIPTION:Speaker: Salil Vadhan (Harvard) \nTitle: Derandomizing Algorithms via Spectral Graph Theory\n\nAbstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms to “toss coins” and output a correct answer with high probability.  However\, a longstanding conjecture in theoretical computer science is that every randomized algorithm can be efficiently “derandomized” — converted into a deterministic algorithm (which always outputs the correct answer) with only a polynomial increase in running time and only a constant-factor increase in space (i.e. memory usage).  In this talk\, I will describe an approach to proving the space (as opposed to time) version of this conjecture via spectral graph theory.  Specifically\, I will explain how randomized space-bounded algorithms are described by random walks on directed graphs\, and techniques in algorithmic spectral graph theory (e.g. solving Laplacian systems) have yielded deterministic space-efficient algorithms for approximating the behavior of such random walks on undirected graphs and Eulerian directed graphs (where every vertex has the same in-degree as out-degree).  If these algorithms can be extended to general directed graphs\, then the aforementioned conjecture about derandomizing space-efficient algorithms will be resolved.\nJoint works with Jack Murtagh\, Omer Reingold\, Aaron Sidford\,  AmirMadhi Ahmadinejad\, Jon Kelner\, and John Peebles.
URL:https://cmsa.fas.harvard.edu/event/3-4-2020-colloquium/
LOCATION:CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-03.04.20-1.png
END:VEVENT
END:VCALENDAR