BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.4.5//EN
X-ORIGINAL-URL:https://ssrc.mit.edu/
X-WR-CALNAME:SSRC - MIT's Sociotechnical Systems Research Center
X-WR-CALDESC:
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
DTSTART;TZID=UTC:20191011T110000
DTEND;TZID=UTC:20191011T120000
DTSTAMP:20211025T204000
UID:MEC-8b2a9c176d358811a479f771a5874c1b@ssrc.mit.edu
CREATED:20211025
LAST-MODIFIED:20211025
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:The Planted Matching Problem
DESCRIPTION:Abstract:\n\nWhat happens when an optimization problem has a good solution built into it, but which is partly obscured by randomness? Here we revisit a classic polynomial-time problem, the minimum perfect matching problem on bipartite graphs. If the edges have random weights in [0,1], Mézard and Parisi — and then Aldous, rigorously — showed that the minimum matching has expected weight zeta(2) = pi^2/6. We consider a “planted” version where a particular matching has weights drawn from an exponential distribution with mean mu/n. When mu < 1/4, the minimum matching is almost identical to the planted one. When mu > 1/4, the overlap between the two is given by a system of differential equations that result from a message-passing algorithm. This is joint work with Mehrdad Moharrami (Michigan) and Jiaming Xu (Duke).\n\nBiography:\n\nCristopher Moore received his B.A. in Physics, Mathematics, and Integrated Science from Northwestern University, and his Ph.D. in Physics from Cornell. From 2000 to 2012 he was a professor at the University of New Mexico, with joint appointments in Computer Science and Physics. Since 2012, Moore has been a resident professor at the Santa Fe Institute; he has also held visiting positions at École Normale Superieure, École Polytechnique, Université Paris 7, the Niels Bohr Institute, Northeastern University, and the University of Michigan. He has published over 150 papers at the boundary between physics and computer science, ranging from quantum computing, to phase transitions in NP-complete problems, to the theory of social networks and efficient algorithms for analyzing their structure. He is an elected Fellow of the American Physical Society, the American Mathematical Society, and the American Association for the Advancement of Science. With Stephan Mertens, he is the author of The Nature of Computation from Oxford University Press.\n\n–\n\nThe MIT Statistics and Data Science Center hosts guest lecturers from around the world in this weekly seminar.\n
URL:https://ssrc.mit.edu/events/the-planted-matching-problem/
LOCATION:E18-304
END:VEVENT
END:VCALENDAR