BEGIN:VCALENDAR VERSION:2.0 PRODID:ics.py - http://git.io/lLljaA BEGIN:VEVENT DESCRIPTION:1ST FEARLESS FRIDAY: To Infinity ... and Graphon'd!\nProfessor Cory B. Scott\, Colorado College \nFriday\, October 24th at 3:00PM | Kresge Lecture Hall (TSC 122) |Rated PG/PG13 (Some Linear Algebra and Probability) | Zoom\n \nAbstract:\nFinite graphs have extensive applications\, including modelling of social networks\, molecules\, transportation networks\, and more. There are well-developed methods for processing graph data\, sampling random graphs\, or running machine learning models on graphs. The practicality of many of these approaches depends on the particular way we choose to represent our network objects\, and on the assumptions we make about what nodes and edges represent. But what if we allowed our graphs to be infinitely large (AKA many nodes) or infinitely dense (AKA many edges) or both? In this talk\, I will discuss some of the ways that mathematicians have developed models of infinite graph-like objects\, or continuous objects that have some of the useful properties we'd like graphs to have. One of the most famous of these models is something called a graphon\, and I'll talk about graphons\, their history\, and their properties. I'll conclude by discussing my current work developing a random infinite graph model\, and how we can use this representation to compare\, match\, and edit graphs.\n\nhttps://today.coloradocollege.edu/events/9249 DTEND:20251024T220000Z LOCATION:Tutt Science 122 - Lecture Hall (Social Science) DTSTART:20251024T210000Z SUMMARY:Fearless Friday: To Infinity ... and Graphon'd! - Professor. Cory B. Scott UID:0075e626-7dc2-417c-9e53-e6b23047e63b END:VEVENT END:VCALENDAR