More from Events Calendar
- Apr 104:00 PMOpen recreational swim for off campus familiesRecreational swims provide a fun and engaging way for children and parents to practice new skills, stay active, and enjoy quality time together in the pool with the MIT community.No Z Center (MIT Recreation - Zesiger Sports and Fitness Center) membership is required to participate.A parent or caregiver must accompany children in the water. Per Z Center policy, each adult may supervise up to two children at a time.Children must be at least 6 months old to join. If younger, they must be able to hold their head up comfortably. Registration is here. Only for MIT Spouses and Partners Connect members.
- Apr 104:00 PMOrganic Syntheses Lecture | Organic Chemistry Seminar Series | Armido Studer (University of Münster)Organic Syntheses Lecture with Armido Studer (University of Münster)Talk Title: TBAhttps://www.uni-muenster.de/Chemie.oc/studer/
- Apr 104:00 PMRichard P. Stanley Seminar in CombinatoricsSpeaker: Matthew Jenssen (King's College London)Title: Non-existence probabilities and lower tails via Gibbs uniqueness on hypertreesAbstract:Given a graph $H$, what is the probability that $G(n,p)$ contains no copy of $H$ or fewer copies than expected? This is a canonical example of a `lower-tail' large deviation probability that arises naturally in combinatorics. Other examples include the probability that a random subset of $[n]$ avoids $k$-term arithmetic progressions or that a random subset of an abelian group is sum free. In this talk, I will discuss a method for determining the logarithmic asymptotics (or rate function) for such probabilities. The method applies for a range of parameters in the `critical regime': between the regime amenable to hypergraph container methods and that amenable to Janson's inequality. The method works in the general framework of estimating the probability that a $p$-random subset of vertices of a $k$-uniform hypergraph contains fewer hyperedges than expected. We show that under some simple structural conditions on the hypergraph and an upper bound on $p$ determined by a phase transition on an infinite hypertree, this probability can be approximated by a formula derived from a Gibbs measure on the hypertree. This is joint work with Will Perkins, Aditya Potukuchi and Michael Simkin.
- Apr 104:00 PMSpeakSmart: Communicating Research with Clarity and ImpactPreparing for a research talk, investor pitch, or interview? Eager to polish your three-minute thesis video, podcast, or public talk? In this NEW, six-session workshop series, learn to refine your speaking and presentation skills across a range of contexts. Whether your audience is intimate or enormous, expert or novice, we will help you find strategies to capture and keep their attention. Each interactive session will invite you to implement tips on tailoring your content, delivery, and visual aids to develop your confidence, clarity, and charisma. At the end of six meetings, you will have solid advice and experience with introducing yourself and your topic, tailoring your talk to diverse audiences, structuring your content, streamlining your flow, practicing effectively, and fielding questions.Session 1: Tue, April 1, 4:00-5:30 p.m. First Impressions Session 2: Thu, April 3, 4:00-5:30 p.m. Engage Your Audience Session 3: Tue, April 8, 4:00-5:30 p.m. Structure Your Presentation Session 4: Thu, April 10, 4:00-5:30 p.m. Tell Your Story Session 5: Tue, April 15, 4:00-5:30 p.m. Enhance Your Presentation Session 6: Thu, April 17, 4:00-5:30 p.m. Finish Strong: Conclusions and Q&A
- Apr 104:00 PMSTEEL: Singularity-aware Reinforcement LearningXiaohong Chen (Yale University)
- Apr 104:00 PMTheory SeminarQuantifying Inefficiency | Yannai Gonczarowski (Harvard)