BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20250307T120000
DTEND;TZID=UTC:20250307T130000
DTSTAMP:20260611T090600
CREATED:20250306T140500Z
LAST-MODIFIED:20250306T140500Z
UID:7959-1741348800-1741352400@aarms.math.ca
SUMMARY:Atlantic Canada Data Science Tour
DESCRIPTION:A Hybrid Seminar Series for University Students in Statistics or Computer Science \n“Mediation Analysis of Recurrent Events”\nGuest Speaker: Shenita Pramij (Memorial University) \nDATE: Friday\, March 7\, 2025\nTIME: 12:00–1:00 p.m.\, Atlantic time\nLOCATION: Online via Zoom \nThis hybrid series for students in statistics and computer science programs features faculty members and students from universities in Atlantic Canada talking about their work and career paths in statistical sciences. The guest speaker for this online presentation will be Shenita Pramij. \nShenita is a PhD student in Statistics at Memorial University of Newfoundland. Her research focuses on mediation analysis\, and she has broad interests in modelling complex processes with applications in healthcare and public policy. She also has extensive experience in the public sector as a compliance researcher. Her work aims to enhance decision-making in public policy and inform targeted interventions. \nPRESENTATION ABSTRACT : Inferring the direct effects of exposure in recurrent event processes\, while accounting for mediating factors\, is crucial\, yet conventional approaches face significant limitations in the presence of complex causal relationships. We introduce two methods to address these challenges. We first explore a two-stage sequential G-estimation method to estimate the controlled direct effect of a randomly assigned exposure\, while accounting for potential mediators and confounders\, using intensity-based models of recurrent event processes. We also introduce a novel one-stage estimation method based on the estimating equations framework\, leveraging the sequential G-estimation principle. We demonstrate that both methods yield unbiased controlled direct effect estimates. The one-stage method also enables the analytical derivation of an estimator for the standard error of the direct effect estimator. We illustrate our approach using a hospital readmission dataset of colorectal cancer patients to estimate the controlled direct effect of sex differences on hospital readmission. \nWe invite you to join us online! (We’ll send you the Zoom link when you register.) \nGET THE DETAILS AND REGISTER HERE
URL:https://aarms.math.ca/event/atlantic-canada-data-science-tour/
LOCATION:Online via Zoom
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20250312T153000
DTEND;TZID=UTC:20250312T163000
DTSTAMP:20260611T090600
CREATED:20250305T143502Z
LAST-MODIFIED:20250305T143502Z
UID:7955-1741793400-1741797000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Time: 3:30 pm\, Atlantic time\, (2:30 pm EST) Wednesday\, Mar. 12\nSpeaker: Ron Gould\, Emory University\nTitle: Looking for Saturation in all Kinds of Places\n\nAbstract:\nGiven a graph $H$\, a graph $G$ is $H$-saturated if $G$ does not contain $H$ as a subgraph\, but the addition of any missing edge to $G$ results in a graph containing $H$ as a subgraph. An $H$-saturated graph with the maximum number of edges is called an extremal graph for $H$ and for a given order $n$ we denoted this as $\ext(n\, H).$   This is the well-known extremal number (or Turan number) of $H$ and is a well studied notion with a deep and beautiful history.\n\nHowever\, the focus of this talk will be the many other saturation questions that can be asked.   These include what is the minimum number of edges in an $H$-saturated graph?  What sizes (i.e. $|E(G)|$)\, other than the minimum or maximum\, also allow $H$-saturated graphs on $n$ vertices?   Is it possible to order the inclusion of the missing edges so that at each stage more copies of $H$ will be included? What about saturation in other settings such as in hypergraphs\, edge-colored graphs\, random graphs\, or within graphs other than the complete graph?\n\nKeywords: saturation\, saturation spectrum\, weak saturation\n \nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1\n\n\nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-28/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250314
DTEND;VALUE=DATE:20250315
DTSTAMP:20260611T090600
CREATED:20250121T174843Z
LAST-MODIFIED:20250121T174843Z
UID:7901-1741910400-1741996799@aarms.math.ca
SUMMARY:Integration Tournament for UPEI students 2025
DESCRIPTION:Competition among UPEI Calculus Students to evaluate integrals the fastest.
URL:https://aarms.math.ca/event/integration-tournament-for-upei-students-2025/
LOCATION:University of Prince Edward Island\, Charlottetown\, Prince Edward Island\, Canada
CATEGORIES:AARMS outreach events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20250319T153000
DTEND;TZID=UTC:20250319T163000
DTSTAMP:20260611T090600
CREATED:20250313T101400Z
LAST-MODIFIED:20250313T101400Z
UID:8039-1742398200-1742401800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:The 2-burning number of a graph\nSpeaker: Ann Trenk\, Wellesley College\n\nAbstract:\nWe discuss a discrete-time model for the spread of information in a graph\, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number\, in this problem\, information spreads in rounds and a new source can appear in each round. For a graph $G$\, we are interested in $b_2(G)$\, the minimum number of rounds until the information has spread to all vertices of graph $G$. We are also interested in finding $t_2(G)$\, the minimum number of sources necessary so that the information spreads to all vertices of $G$ in $b_2(G)$ rounds. In addition to discussing general results\, we find $b_2(G)$ and $t_2(G)$ for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters.\n\nThis is joint work with Catherine Jacobs (Wellesley College) and Margaret-Ellen Messinger (Mount Allison University).\n \nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1\n\nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-29/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250324
DTEND;VALUE=DATE:20250329
DTSTAMP:20260611T090600
CREATED:20250121T181114Z
LAST-MODIFIED:20250121T181114Z
UID:7908-1742774400-1743206399@aarms.math.ca
SUMMARY:Mini course "Vertex operator algebras and their representations"
DESCRIPTION:Vertex operator algebras have been a topic of interest in mathematical physics for several decades\, as they constitute one possible approach to formalize physical concepts from conformal field theory. They have relations to several other areas of mathematics\, most notably to the theory of finite simple groups. This specific relation lead in fact to the award of the Fields Medal to Professor Richard Borcherds at the International Congress of Mathematicians in Berlin in 1998. Professor Gannon is the author of a well-known monograph on this topic. \nThe minicourse will consist of five lectures of 90 minutes each. The lectures will be aimed at students\, primarily at the graduate level. We hope to attract about 20 participants from Memorial University\, Atlantic Canada\, and other parts of Canada\, and possibly some international participants.
URL:https://aarms.math.ca/event/mini-course-vertex-operator-algebras-and-their-representations/
LOCATION:Memorial University (St. John’s Campus)\, St. John's\, Newfoundland and Labrador\, Canada
CATEGORIES:AARMS schools and minicourses
ORGANIZER;CN="Yorck Sommerhauser":MAILTO:sommerh@mun.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20250326T153000
DTEND;TZID=UTC:20250326T163000
DTSTAMP:20260611T090600
CREATED:20250319T205857Z
LAST-MODIFIED:20250319T205857Z
UID:8166-1743003000-1743006600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:The Burning Number of Large Caterpillars \nDanielle Cox\, Mount Saint Vincent University \nAbstract:\nIn this talk we will look at the history of the graph burning conjecture and the state of the art. We will also prove the conjecture for sufficiently large p-caterpillars. This is joint work with Kerry Ojakian (CUNY) and Margaret-Ellen Messinger (Mt Allison).\n\nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1\n\nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-30/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR