BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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: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:20200203T120000
DTEND;TZID=America/New_York:20200203T130000
DTSTAMP:20240212T091951Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200205T163000
DTEND;TZID=America/New_York:20200205T173000
DTSTAMP:20240507T204003Z
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:20240212T091828Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200207T163000
DTEND;TZID=America/New_York:20200207T173000
DTSTAMP:20240507T203547Z
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:20200213T103000
DTEND;TZID=America/New_York:20200213T120000
DTSTAMP:20240212T084133Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200219T163000
DTEND;TZID=America/New_York:20200219T173000
DTSTAMP:20240507T202728Z
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/
LOCATION:MA
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:20240507T203004Z
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:20240212T083840Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200221T103000
DTEND;TZID=America/New_York:20200221T113000
DTSTAMP:20240212T082037Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200225T150000
DTEND;TZID=America/New_York:20200225T160000
DTSTAMP:20240212T081000Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200225T173300
DTEND;TZID=America/New_York:20200225T173300
DTSTAMP:20240213T102444Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200226T103000
DTEND;TZID=America/New_York:20200226T120000
DTSTAMP:20240212T081516Z
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/
LOCATION:MA
CATEGORIES:Seminars
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200228T164500
DTEND;TZID=America/New_York:20200228T174500
DTSTAMP:20240507T203156Z
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