Have some fun(nel) on a tunnel or sun(nel) walk! Join us for a 30-minute volunteer-led walk either through MIT’s famous tunnel system or around Killian Court. As the weather gets warmer, walk leaders may choose to take the group outside. Is the weather warm and you missed the start? Find the group on Killian Court and join in!Sun(nel) Walk Leaders will identify themselves by holding a white flag at the meeting location.Location details: Meet in the atrium by the staircase. [See image below]Prize Drawing: Attend a walk and scan a QR code from the walk leaders to be entered into a drawing for a getfit canvas boat tote bag at the end of the getfit challenge. The more walks you attend, the more entries you get. Winner will be drawn and notified at the end of April. Winner does not need to be a getfit participant.Disclaimer: Tunnel walks are led by volunteers. In the rare occasion when a volunteer isn’t able to make it, we will do our best to notify participants. In the event we are unable to notify participants and a walk leader does not show up, we encourage you to walk as much as you feel comfortable doing so. We recommend checking this calendar just before you head out.Getfit is a 12-week fitness challenge for the entire MIT community. These tunnel walks are open to the entire MIT community and you do not need to be a current getfit participant to join.

Have some fun(nel) on a tunnel or sun(nel) walk! Join us for a 30-minute volunteer-led walk either through MIT’s famous tunnel system or around Killian Court. As the weather gets warmer, walk leaders may choose to take the group outside. Is the weather warm and you missed the start? Find the group on Killian Court and join in!Location details: Meet in the lobby with the big mirror, right inside the Collier Memorial entrance to Stata. Location photo below.Sun(nel) Walk Leaders will identify themselves by holding a white flag at the meeting location.Prize Drawing: Attend a walk and scan a QR code from the walk leaders to be entered into a drawing for a getfit canvas boat tote bag at the end of the getfit challenge. The more walks you attend, the more entries you get. Winner will be drawn and notified at the end of April. Winner does not need to be a getfit participant.Disclaimer: These walks are led by volunteers. In the rare occasion when a volunteer isn’t able to make it, we will do our best to notify participants. In the event we are unable to notify participants and a walk leader does not show up, we encourage you to walk as much as you feel comfortable doing so. We recommend checking this calendar just before you head out!Getfit is a 12-week fitness challenge for the entire MIT community. These walks are open to the entire MIT community and you do not need to be a current getfit participant to join.

The Illusion of Time: Gender Gaps in Search and Employment | Oriana Bandiera

Ten minutes for your mind@2:50 every day at 2:50 pm in multiple time zones:Europa@2:50, EET, Athens, Helsinki (UTC+2) (7:50 am EST) https://us02web.zoom.us/j/88298032734Atlantica@2:50, EST, New York, Toronto (UTC-4) https://us02web.zoom.us/j/85349851047Pacifica@2:50, PST, Los Angeles, Vancouver (UTC=7) (5:50 pm EST) https://us02web.zoom.us/j/85743543699Almost everything works better again if you unplug it for a bit, including your mind. Stop by and unplug. Get the benefits of mindfulness without the fuss.@2:50 meets at the same time every single day for ten minutes of quiet together.No pre-requisite, no registration needed.Visit the website to view all @2:50 time zones each day.at250.org or at250.mit.edu

MIT Program in Polymers and Soft Matter (PPSM) Seminar

Speaker: John Urschel (MIT)Title: Nodal Statistics for Graphs and MatricesAbstract:The study of nodal statistics provides insight into the spectral properties of graphs and matrices, drawing strong parallels with classical results in analysis. In this talk, we will give an overview of the field, covering key results on nodal domains and nodal counts for graphs and their connection to known results in the continuous setting. In addition, we will discuss some recent progress towards a complete understanding of the extremal properties of the nodal statistics of a matrix.