{"id":199972,"date":"2014-04-22T11:50:17","date_gmt":"2014-04-22T11:50:17","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/events\/northwest-probability-seminar-2014\/"},"modified":"2025-08-06T12:01:55","modified_gmt":"2025-08-06T19:01:55","slug":"northwest-probability-seminar-2014","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/northwest-probability-seminar-2014\/","title":{"rendered":"Northwest Probability Seminar 2014"},"content":{"rendered":"\n\n

\"logo_msr\"<\/p>\n

\"pims-circle-logo\"Opens in a new tab<\/span><\/p>\n

This is a recap of the\u00a016th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research. In 2014, the\u00a0conference was hosted at Microsoft, supported by Microsoft Research and the Pacific Institute for the Mathematical Sciences (opens in new tab)<\/span><\/a> (PIMS).<\/p>\n

The Birnbaum (opens in new tab)<\/span><\/a> Lecture in Probability\u00a0was given by Srinivasa Varadhan (opens in new tab)<\/span><\/a> (New York University). [Past Birnbaum speakers (opens in new tab)<\/span><\/a>] \u00a0Other\u00a0speakers were\u00a0Ioana Dumitriu (University of Washington), Alexander Holroyd (Microsoft Research), Tim Hulshof (University of British Columbia), and Benjamin Young (University of Oregon).<\/p>\n

\"nw-probability-2014\" (opens in new tab)<\/span><\/a><\/p>\n

\n

Schedule<\/h2>\n\n\n\n\n\n\n\n\n\n\n\n\n
9:00 – 11:15<\/td>\nCoffee and muffins<\/td>\n<\/tr>\n
11:15 –\u00a011:50<\/td>\nAlexander Holroyd (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
12:00 – 12:35<\/td>\nTim Hulshof (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
12:40 – 1:40<\/td>\nLunch (catered)<\/td>\n<\/tr>\n
1:40 – 2:15<\/td>\nProbability demos and open problems<\/td>\n<\/tr>\n
2:20\u00a0– 3:15<\/td>\nSrinivasa Varadhan (opens in new tab)<\/span><\/a> (Birnbaum lecture)<\/td>\n<\/tr>\n
3:25\u00a0– 4:00<\/td>\nBenjamin Young (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
4:05\u00a0– 4:35<\/td>\nTea and snacks<\/td>\n<\/tr>\n
4:35 – 5:10<\/td>\nIoana Dumitriu (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
6:00\u00a0–<\/td>\nDinner (no-host, at Haiku sushi & seafood buffet (opens in new tab)<\/span><\/a>, downtown Redmond)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

Opens in a new tab<\/span><\/p>\n

Talk titles and abstracts with links to video recordings<\/h2>\n

Alexander E Holroyd<\/b> (Microsoft Research)<\/p>\n

Title:<\/em> Finitely dependent coloring<\/a><\/p>\n

Abstract:<\/em> Do local constraints demand global coordination? I’ll address a particularly simple formulation of this question: can the vertices of a graph be assigned random colours in a stationary way, so that neighboring colours always differ, but without long-range dependence? The quest to answer this has led to the discovery of a beautiful yet mysterious new stochastic process that seemingly has no right to exist, while overturning the conventional thinking on a fundamental 49-year old question.
\n(Joint work with Tom Liggett.)<\/p>\n

Bio:<\/em> Senior Researcher at Microsoft Research, Redmond. PhD: University of Cambridge (2000). Previous positions: UCLA (1999-2002), UC Berkeley (2002-2003), University of British Columbia (2002-2008). Awards: Rollo Davidson Prize (2004), Andre-Aisenstadt Prize (2007).<\/p>\n

Tim Hulshof<\/strong> (University of British Columbia)<\/p>\n

Title:<\/em> Sharp higher order corrections for the critical value of a bootstrap percolation model<\/a><\/p>\n

Abstract:<\/em> Bootstrap Percolation (BP) models are simple cellular automata with a deterministic growth rule and random initial configuration. It is known that (critical) BP models on the lattice undergo a metastable phase transition on a lattice of fixed size, as the density of the initial configuration increases. Holroyd (2004) determined sharp first order asymptotics for the critical value for the canonical nearest-neighbor model in 2D. Surprisingly, this value turned out to be very far removed from computer simulations of BP on large lattices, suggesting that higher order corrections to the critical value may dominate even on large lattices. We study the scaling of the critical value for the so-called anisotropic (1,2)-model. Duminil-Copin and van Enter recently showed sharp first order asymptotics for the critical value of this model. We determine sharp second and third order corrections, and show that they are both large enough to dominate the critical value of anisotropic bootstrap percolation on any scale that is feasibly accessed by computers.
\nBased on joint work with Hugo Duminil-Copin, Aernout van Enter, and Robert Morris.<\/p>\n

Bio:<\/em> Tim Hulshof received his doctoral degree in 2013 under the supervision of Remco van der Hofstad at the Eindhoven University of Technology, the Netherlands. Currently he is a postdoctoral fellow at UBC and PIMS in Vancouver.<\/p>\n

Srinivasa Varadhan<\/b> (New York University)<\/p>\n

Title:<\/em> The role of compactness in large deviations<\/a><\/p>\n

Abstract:<\/em> The estimates obtained in large deviations are basically local estimates. While it is not a problem for lower bounds it is a problem for upper bounds. In the absence of exponential tightness some type of “compactification” of the space is needed. We will look at some examples.<\/p>\n

Bio:<\/em> Professor of Mathematics at Courant Institute New York University. Doctoral degree from Indian Statistical Institute (1963), postdoc at Courant Institute (63-66) followed by faculty position there. Member National Academy of Sciences in USA and Fellow of the Royal Society in UK. Awards include Steele Prize of AMS, Birkhoff prize of SIAM-AMS, and the Abel Prize of the Norwegian Academy of Sciences.<\/p>\n

Benjamin Young<\/strong> (University of Oregon)<\/p>\n

Title:<\/em> Sampling from the Fomin-Kirillov distribution<\/a><\/p>\n

Abstract:<\/em> I will describe recent joint work with Sara Billey (UW) and Alexander Holroyd (MSR), generalizing earlier work of mine, in which we bijectively prove the general case of Macdonald’s identity in Schubert calculus. As a consequence, we also get a sampling algorithm for a probability distribution on reduced words which is implicit in work of Fomin and Kirillov. The proof involves several novel uses of David Little’s generalized “bumping” algorithm.<\/p>\n

Bio:<\/em> BY received his PhD under Jim Bryan and Richard Kenyon at UBC in 2008. After postdocs at McGill, MSRI, KTH and MSRI again, he became assistant professor at the University of Oregon in 2012. He works in combinatorics, particularly in areas which are close to algebraic geometry, probability, representation theory and statistical mechanics.<\/p>\n

Ioana Dumitriu<\/strong> (University of Washington)<\/p>\n

Title:<\/em> A Regular Stochastic Block Model<\/a><\/p>\n

Abstract:<\/em> The famous Stochastic Block Model (SBM) has been recently completely solved independently by Massoulie and Mossel-Neeman-Sly. Inspired by their work, we have decided to examine a regular variant of the graph; the restrictive nature of the constraints makes the problem easier, but at the same time more challenging (given that we can push the thresholds lower, how much lower can we push them?) This is joint work with Gerandy Brito, Shirshendu Ganguly, Chris Hoffman, and Linh Tran.<\/p>\n

Bio:<\/em> Ioana is an Associate Professor in the Math Department at University of Washington. She received her PhD at MIT in 2003, working with Alan Edelman; after that, she was a Miller Fellow at UC Berkeley until 2006, before happily landing in the Great Pacific NW. She is the proud collector of mathematical labels, all of which are great, and none of which quite fits: “numerical analyst,” “combinatorialist,” “linear algebrist,” to which she is now very glad to add “probabilist.”Opens in a new tab<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

Opens in a new tab This is a recap of the\u00a016th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research. In 2014, the\u00a0conference was hosted at Microsoft, supported by Microsoft Research and […]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2014-10-25","msr_enddate":"2014-10-25","msr_location":"Microsoft Research 99\/1919","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":true,"msr_hide_image_in_river":0,"footnotes":""},"research-area":[13546],"msr-region":[197900],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-199972","msr-event","type-msr-event","status-publish","hentry","msr-research-area-computational-sciences-mathematics","msr-region-north-america","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"\n\n

\"logo_msr\"<\/p>\n

\"pims-circle-logo\"Opens in a new tab<\/span><\/p>\n

This is a recap of the\u00a016th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research. In 2014, the\u00a0conference was hosted at Microsoft, supported by Microsoft Research and the Pacific Institute for the Mathematical Sciences (opens in new tab)<\/span><\/a> (PIMS).<\/p>\n

The Birnbaum (opens in new tab)<\/span><\/a> Lecture in Probability\u00a0was given by Srinivasa Varadhan (opens in new tab)<\/span><\/a> (New York University). [Past Birnbaum speakers (opens in new tab)<\/span><\/a>] \u00a0Other\u00a0speakers were\u00a0Ioana Dumitriu (University of Washington), Alexander Holroyd (Microsoft Research), Tim Hulshof (University of British Columbia), and Benjamin Young (University of Oregon).<\/p>\n

\"nw-probability-2014\" (opens in new tab)<\/span><\/a><\/p>\n

\n

Schedule<\/h2>\n\n\n\n\n\n\n\n\n\n\n\n\n
9:00 – 11:15<\/td>\nCoffee and muffins<\/td>\n<\/tr>\n
11:15 –\u00a011:50<\/td>\nAlexander Holroyd (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
12:00 – 12:35<\/td>\nTim Hulshof (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
12:40 – 1:40<\/td>\nLunch (catered)<\/td>\n<\/tr>\n
1:40 – 2:15<\/td>\nProbability demos and open problems<\/td>\n<\/tr>\n
2:20\u00a0– 3:15<\/td>\nSrinivasa Varadhan (opens in new tab)<\/span><\/a> (Birnbaum lecture)<\/td>\n<\/tr>\n
3:25\u00a0– 4:00<\/td>\nBenjamin Young (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
4:05\u00a0– 4:35<\/td>\nTea and snacks<\/td>\n<\/tr>\n
4:35 – 5:10<\/td>\nIoana Dumitriu (opens in new tab)<\/span><\/a><\/td>\n<\/tr>\n
6:00\u00a0–<\/td>\nDinner (no-host, at Haiku sushi & seafood buffet (opens in new tab)<\/span><\/a>, downtown Redmond)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

Opens in a new tab<\/span><\/p>\n

Talk titles and abstracts with links to video recordings<\/h2>\n

Alexander E Holroyd<\/b> (Microsoft Research)<\/p>\n

Title:<\/em> Finitely dependent coloring<\/a><\/p>\n

Abstract:<\/em> Do local constraints demand global coordination? I’ll address a particularly simple formulation of this question: can the vertices of a graph be assigned random colours in a stationary way, so that neighboring colours always differ, but without long-range dependence? The quest to answer this has led to the discovery of a beautiful yet mysterious new stochastic process that seemingly has no right to exist, while overturning the conventional thinking on a fundamental 49-year old question.
\n(Joint work with Tom Liggett.)<\/p>\n

Bio:<\/em> Senior Researcher at Microsoft Research, Redmond. PhD: University of Cambridge (2000). Previous positions: UCLA (1999-2002), UC Berkeley (2002-2003), University of British Columbia (2002-2008). Awards: Rollo Davidson Prize (2004), Andre-Aisenstadt Prize (2007).<\/p>\n

Tim Hulshof<\/strong> (University of British Columbia)<\/p>\n

Title:<\/em> Sharp higher order corrections for the critical value of a bootstrap percolation model<\/a><\/p>\n

Abstract:<\/em> Bootstrap Percolation (BP) models are simple cellular automata with a deterministic growth rule and random initial configuration. It is known that (critical) BP models on the lattice undergo a metastable phase transition on a lattice of fixed size, as the density of the initial configuration increases. Holroyd (2004) determined sharp first order asymptotics for the critical value for the canonical nearest-neighbor model in 2D. Surprisingly, this value turned out to be very far removed from computer simulations of BP on large lattices, suggesting that higher order corrections to the critical value may dominate even on large lattices. We study the scaling of the critical value for the so-called anisotropic (1,2)-model. Duminil-Copin and van Enter recently showed sharp first order asymptotics for the critical value of this model. We determine sharp second and third order corrections, and show that they are both large enough to dominate the critical value of anisotropic bootstrap percolation on any scale that is feasibly accessed by computers.
\nBased on joint work with Hugo Duminil-Copin, Aernout van Enter, and Robert Morris.<\/p>\n

Bio:<\/em> Tim Hulshof received his doctoral degree in 2013 under the supervision of Remco van der Hofstad at the Eindhoven University of Technology, the Netherlands. Currently he is a postdoctoral fellow at UBC and PIMS in Vancouver.<\/p>\n

Srinivasa Varadhan<\/b> (New York University)<\/p>\n

Title:<\/em> The role of compactness in large deviations<\/a><\/p>\n

Abstract:<\/em> The estimates obtained in large deviations are basically local estimates. While it is not a problem for lower bounds it is a problem for upper bounds. In the absence of exponential tightness some type of “compactification” of the space is needed. We will look at some examples.<\/p>\n

Bio:<\/em> Professor of Mathematics at Courant Institute New York University. Doctoral degree from Indian Statistical Institute (1963), postdoc at Courant Institute (63-66) followed by faculty position there. Member National Academy of Sciences in USA and Fellow of the Royal Society in UK. Awards include Steele Prize of AMS, Birkhoff prize of SIAM-AMS, and the Abel Prize of the Norwegian Academy of Sciences.<\/p>\n

Benjamin Young<\/strong> (University of Oregon)<\/p>\n

Title:<\/em> Sampling from the Fomin-Kirillov distribution<\/a><\/p>\n

Abstract:<\/em> I will describe recent joint work with Sara Billey (UW) and Alexander Holroyd (MSR), generalizing earlier work of mine, in which we bijectively prove the general case of Macdonald’s identity in Schubert calculus. As a consequence, we also get a sampling algorithm for a probability distribution on reduced words which is implicit in work of Fomin and Kirillov. The proof involves several novel uses of David Little’s generalized “bumping” algorithm.<\/p>\n

Bio:<\/em> BY received his PhD under Jim Bryan and Richard Kenyon at UBC in 2008. After postdocs at McGill, MSRI, KTH and MSRI again, he became assistant professor at the University of Oregon in 2012. He works in combinatorics, particularly in areas which are close to algebraic geometry, probability, representation theory and statistical mechanics.<\/p>\n

Ioana Dumitriu<\/strong> (University of Washington)<\/p>\n

Title:<\/em> A Regular Stochastic Block Model<\/a><\/p>\n

Abstract:<\/em> The famous Stochastic Block Model (SBM) has been recently completely solved independently by Massoulie and Mossel-Neeman-Sly. Inspired by their work, we have decided to examine a regular variant of the graph; the restrictive nature of the constraints makes the problem easier, but at the same time more challenging (given that we can push the thresholds lower, how much lower can we push them?) This is joint work with Gerandy Brito, Shirshendu Ganguly, Chris Hoffman, and Linh Tran.<\/p>\n

Bio:<\/em> Ioana is an Associate Professor in the Math Department at University of Washington. She received her PhD at MIT in 2003, working with Alan Edelman; after that, she was a Miller Fellow at UC Berkeley until 2006, before happily landing in the Great Pacific NW. She is the proud collector of mathematical labels, all of which are great, and none of which quite fits: “numerical analyst,” “combinatorialist,” “linear algebrist,” to which she is now very glad to add “probabilist.”Opens in a new tab<\/span><\/p>\n","tab-content":[{"id":0,"name":"Summary","content":"This is a recap of the\u00a016th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research. In 2014, the\u00a0conference was hosted at Microsoft, supported by Microsoft Research and the Pacific Institute for the Mathematical Sciences<\/a> (PIMS).\r\n\r\nThe Birnbaum<\/a> Lecture in Probability\u00a0was given by Srinivasa Varadhan<\/a> (New York University). [Past Birnbaum speakers<\/a>] \u00a0Other\u00a0speakers were\u00a0Ioana Dumitriu (University of Washington), Alexander Holroyd (Microsoft Research), Tim Hulshof (University of British Columbia), and Benjamin Young (University of Oregon).\r\n\r\n\"nw-probability-2014\"<\/a>\r\n

\r\n

Schedule<\/h2>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
9:00 - 11:15<\/td>\r\nCoffee and muffins<\/td>\r\n<\/tr>\r\n
11:15 -\u00a011:50<\/td>\r\nAlexander Holroyd<\/a><\/td>\r\n<\/tr>\r\n
12:00 - 12:35<\/td>\r\nTim Hulshof<\/a><\/td>\r\n<\/tr>\r\n
12:40 - 1:40<\/td>\r\nLunch (catered)<\/td>\r\n<\/tr>\r\n
1:40 - 2:15<\/td>\r\nProbability demos and open problems<\/td>\r\n<\/tr>\r\n
2:20\u00a0- 3:15<\/td>\r\nSrinivasa Varadhan<\/a> (Birnbaum lecture)<\/td>\r\n<\/tr>\r\n
3:25\u00a0- 4:00<\/td>\r\nBenjamin Young<\/a><\/td>\r\n<\/tr>\r\n
4:05\u00a0- 4:35<\/td>\r\nTea and snacks<\/td>\r\n<\/tr>\r\n
4:35 - 5:10<\/td>\r\nIoana Dumitriu<\/a><\/td>\r\n<\/tr>\r\n
6:00\u00a0-<\/td>\r\nDinner (no-host, at Haiku sushi & seafood buffet<\/a>, downtown Redmond)<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>"},{"id":1,"name":"Abstract and Video Archive","content":"

Talk titles and abstracts with links to video recordings<\/h2>\r\nAlexander E Holroyd<\/b> (Microsoft Research)\r\n\r\nTitle:<\/em> Finitely dependent coloring<\/a>\r\n\r\nAbstract:<\/em> Do local constraints demand global coordination? I'll address a particularly simple formulation of this question: can the vertices of a graph be assigned random colours in a stationary way, so that neighboring colours always differ, but without long-range dependence? The quest to answer this has led to the discovery of a beautiful yet mysterious new stochastic process that seemingly has no right to exist, while overturning the conventional thinking on a fundamental 49-year old question.\r\n(Joint work with Tom Liggett.)\r\n\r\nBio:<\/em> Senior Researcher at Microsoft Research, Redmond. PhD: University of Cambridge (2000). Previous positions: UCLA (1999-2002), UC Berkeley (2002-2003), University of British Columbia (2002-2008). Awards: Rollo Davidson Prize (2004), Andre-Aisenstadt Prize (2007).\r\n\r\nTim Hulshof<\/strong> (University of British Columbia)\r\n\r\nTitle:<\/em> Sharp higher order corrections for the critical value of a bootstrap percolation model<\/a>\r\n\r\nAbstract:<\/em> Bootstrap Percolation (BP) models are simple cellular automata with a deterministic growth rule and random initial configuration. It is known that (critical) BP models on the lattice undergo a metastable phase transition on a lattice of fixed size, as the density of the initial configuration increases. Holroyd (2004) determined sharp first order asymptotics for the critical value for the canonical nearest-neighbor model in 2D. Surprisingly, this value turned out to be very far removed from computer simulations of BP on large lattices, suggesting that higher order corrections to the critical value may dominate even on large lattices. We study the scaling of the critical value for the so-called anisotropic (1,2)-model. Duminil-Copin and van Enter recently showed sharp first order asymptotics for the critical value of this model. We determine sharp second and third order corrections, and show that they are both large enough to dominate the critical value of anisotropic bootstrap percolation on any scale that is feasibly accessed by computers.\r\nBased on joint work with Hugo Duminil-Copin, Aernout van Enter, and Robert Morris.\r\n\r\nBio:<\/em> Tim Hulshof received his doctoral degree in 2013 under the supervision of Remco van der Hofstad at the Eindhoven University of Technology, the Netherlands. Currently he is a postdoctoral fellow at UBC and PIMS in Vancouver.\r\n\r\nSrinivasa Varadhan<\/b> (New York University)\r\n\r\nTitle:<\/em> The role of compactness in large deviations<\/a>\r\n\r\nAbstract:<\/em> The estimates obtained in large deviations are basically local estimates. While it is not a problem for lower bounds it is a problem for upper bounds. In the absence of exponential tightness some type of \"compactification\" of the space is needed. We will look at some examples.\r\n\r\nBio:<\/em> Professor of Mathematics at Courant Institute New York University. Doctoral degree from Indian Statistical Institute (1963), postdoc at Courant Institute (63-66) followed by faculty position there. Member National Academy of Sciences in USA and Fellow of the Royal Society in UK. Awards include Steele Prize of AMS, Birkhoff prize of SIAM-AMS, and the Abel Prize of the Norwegian Academy of Sciences.\r\n\r\nBenjamin Young<\/strong> (University of Oregon)\r\n\r\nTitle:<\/em> Sampling from the Fomin-Kirillov distribution<\/a>\r\n\r\nAbstract:<\/em> I will describe recent joint work with Sara Billey (UW) and Alexander Holroyd (MSR), generalizing earlier work of mine, in which we bijectively prove the general case of Macdonald's identity in Schubert calculus. As a consequence, we also get a sampling algorithm for a probability distribution on reduced words which is implicit in work of Fomin and Kirillov. The proof involves several novel uses of David Little's generalized \"bumping\" algorithm.\r\n\r\nBio:<\/em> BY received his PhD under Jim Bryan and Richard Kenyon at UBC in 2008. After postdocs at McGill, MSRI, KTH and MSRI again, he became assistant professor at the University of Oregon in 2012. He works in combinatorics, particularly in areas which are close to algebraic geometry, probability, representation theory and statistical mechanics.\r\n\r\nIoana Dumitriu<\/strong> (University of Washington)\r\n\r\nTitle:<\/em> A Regular Stochastic Block Model<\/a>\r\n\r\nAbstract:<\/em> The famous Stochastic Block Model (SBM) has been recently completely solved independently by Massoulie and Mossel-Neeman-Sly. Inspired by their work, we have decided to examine a regular variant of the graph; the restrictive nature of the constraints makes the problem easier, but at the same time more challenging (given that we can push the thresholds lower, how much lower can we push them?) This is joint work with Gerandy Brito, Shirshendu Ganguly, Chris Hoffman, and Linh Tran.\r\n\r\nBio:<\/em> Ioana is an Associate Professor in the Math Department at University of Washington. She received her PhD at MIT in 2003, working with Alan Edelman; after that, she was a Miller Fellow at UC Berkeley until 2006, before happily landing in the Great Pacific NW. She is the proud collector of mathematical labels, all of which are great, and none of which quite fits: \"numerical analyst,\" \"combinatorialist,\" \"linear algebrist,\" to which she is now very glad to add \"probabilist.\""}],"msr_startdate":"2014-10-25","msr_enddate":"2014-10-25","msr_event_time":"","msr_location":"Microsoft Research 99\/1919","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"October 25, 2014","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":null,"event_excerpt":"This is a recap of the\u00a016th Northwest Probability Seminar, a one-day mini-conference organized by the University of Washington, the Oregon State University, the University of British Columbia, the University of Oregon, and the Theory Group at Microsoft Research. In 2014, the\u00a0conference was hosted at Microsoft, supported by Microsoft Research and the Pacific Institute for the Mathematical Sciences (PIMS). The Birnbaum Lecture in Probability\u00a0was given by Srinivasa Varadhan (New York University). [Past Birnbaum speakers] \u00a0Other\u00a0speakers were\u00a0Ioana…","msr_research_lab":[],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/199972","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":2,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/199972\/revisions"}],"predecessor-version":[{"id":1147383,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/199972\/revisions\/1147383"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=199972"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=199972"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=199972"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=199972"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=199972"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=199972"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=199972"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=199972"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=199972"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}