BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//The Center for Science & Society at Columbia University - ECPv5.6.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:The Center for Science & Society at Columbia University
X-ORIGINAL-URL:https://blogs.cuit.columbia.edu/scisoc
X-WR-CALDESC:Events for The Center for Science & Society at Columbia University
BEGIN:VTIMEZONE
TZID:America/Halifax
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20160313T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20161106T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20160420T170000
DTEND;TZID=America/Halifax:20160420T180000
DTSTAMP:20260607T001535
CREATED:20160330T194037Z
LAST-MODIFIED:20161222T214417Z
UID:1901-1461171600-1461175200@blogs.cuit.columbia.edu
SUMMARY:Jennifer Tour Chayes - Once Upon a Graph: How to Get from Now to Then in Massive Networks
DESCRIPTION:Networks are increasingly important in many aspects of our world: physical networks like transportation networks\, utility networks and the Internet\, online information networks like the WWW\, online social networks like Facebook and Twitter\, epidemiological networks for global disease transmission\, genomic and protein networks in computational biology\, and many more. How do we model and learn these networks? In contrast to conventional learning problems\, where we have many independent samples\, it is often the case for these networks that we can get only one independent sample. How do we use a single snapshot today to learn a model for the network\, and therefore be able to predict a similar\, but larger network in the future? In the case of relatively small or moderately sized networks\, it’s appropriate to model the network parametrically\, and attempt to learn these parameters. For massive networks\, a non-parametric representation is more appropriate. Here I show how to use the theory of graph limits\, developed over the last decade\, to give consistent estimators for machine learning of massive sparse networks\, and moreover how to do this in a way that protects the privacy of individuals on the network. \nJennifer Tour Chayes is Distinguished Scientist and Managing Director of Microsoft Research New England in Cambridge\, Massachusetts\, which she co-founded in 2008\, and Microsoft Research New York City\, which she co-founded in 2012. These two laboratories are widely renowned interdisciplinary centers\, bringing together computer scientists\, mathematicians\, physicists\, social scientists\, and biologists\, and helping to lay the foundations of data science. \nThis event is free and open to the public. \n\nOrganizing Committee\nQ. Du (APAM)\, D. Goldfarb (IEOR)\, E. Grinspun (Computer Science & APAM)\, I. Karatzas (Mathematics)\, M.I. Weinstein (APAM & Mathematics) \nThis lecture series is made possible with the generous support of Columbia Engineering Dean Mary C. Boyce. This is a Joint Colloquium with Columbia Data Science Institute.\n \nFor information\, contact Prof. M.I. Weinstein\, miw2103@columbia.edu or see: http://engineering.columbia.edu/distinguished-colloquium-series-interdisciplinary-and-applied-mathematics\n \nColumbia University makes every effort to accommodate individuals with disabilities. If you require disability accommodations to attend an event at Columbia University\, please contact Disability Services at 212-854-2388 at least 10 days in advance of the event \nMorningside Accessibility Map:\nhttp://www.columbia.edu/files/columbia/content/accessibilitymap2014.pdf
URL:https://blogs.cuit.columbia.edu/scisoc/cssevent/1901/
CATEGORIES:Columbia University Events
END:VEVENT
END:VCALENDAR