08:00 - 08:30 ADT
Patterson Lobby
Schedule
* All times are based on Canada/Atlantic AST.
08:00
Canada/Atlantic
08:30
Canada/Atlantic
4 parallel sessions11:00
Canada/Atlantic
11:00 - 12:00 ADT
Beveridge Arts Centre 244
Sedgwick Lecture (CS): Alexis Morris
Title: Toward Immersive Smart Spaces that Care: Computer Science and Creativity for a Science Fiction World. Abstract: Ours is a fantastic time, filled with advancements driven by computer science, enabling artificial intelligence, world sensing and control, and deep immersive connections to become possible. We are on the cusp of converging revolutions that transform our relationship to the world around us in exciting ways. New possibilities open for computer scientists to embrace design-science and new forms of creation with technology. This talk is about where these themes meet for our everyday environments, with a focus on designing mixed reality smart-spaces that will eventually come alive. Join me in this conversation about a future where science fiction becomes reality.
13:30
Canada/Atlantic
3 parallel sessions16:00
Canada/Atlantic
16:00 - 17:00 ADT
Beveridge Arts Centre 244
Blundon Lecture (Mathematics): Louigi Addario-Berry
Title: Random graphs and random trees Abstract: One of the most active areas of research in probability theory concerns phase transitions: systems that change state when a parameter crosses a certain threshold. Melting and boiling points are common real-world examples of phase transitions. The ubiquity of phase transitions in real-world systems has spurred mathematicians to try to find tractable mathematical models which provably exhibit phase transitions.For systems possessing a phase transition, it is common to study the system's behaviour when the parameter is at or near the threshold (the so-called critical behaviour of the system). Frequently, around the threshold, fascinating self-similar or fractal structures emerge, at least conjecturally. I will give a high-level introduction to the subject, then zoom in on two settings in which it is possible to prove mathematically rigorous results: those of random graphs and random trees.
